%0 Conference Paper %1 conf/walcom/MahajanNV09 %A Mahajan, Meena %A Nimbhorkar, Prajakta %A Varadarajan, Kasturi R. %B WALCOM %D 2009 %E Das, Sandip %E Uehara, Ryuhei %I Springer %K dblp %P 274-285 %T The Planar k-Means Problem is NP-Hard. %U http://dblp.uni-trier.de/db/conf/walcom/walcom2009.html#MahajanNV09 %V 5431 %@ 978-3-642-00201-4

@inproceedings{conf/walcom/MahajanNV09, added-at = {2022-01-03T00:00:00.000+0100}, author = {Mahajan, Meena and Nimbhorkar, Prajakta and Varadarajan, Kasturi R.}, biburl = {https://www.bibsonomy.org/bibtex/2860d32db1160a0ed7773d54df501ab3d/dblp}, booktitle = {WALCOM}, crossref = {conf/walcom/2009}, editor = {Das, Sandip and Uehara, Ryuhei}, ee = {https://www.wikidata.org/entity/Q56449832}, interhash = {d51b4454fa0d8f2cfd0ebea37844c48b}, intrahash = {860d32db1160a0ed7773d54df501ab3d}, isbn = {978-3-642-00201-4}, keywords = {dblp}, pages = {274-285}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, timestamp = {2024-04-10T08:53:51.000+0200}, title = {The Planar k-Means Problem is NP-Hard.}, url = {http://dblp.uni-trier.de/db/conf/walcom/walcom2009.html#MahajanNV09}, volume = 5431, year = 2009 }