Researchclopedia

Research Researchers Institutions Topics Submit About

Command Palette

Search for a command to run...

Researchclopedia

Research Researchers Institutions About

© 2026 Researchclopedia. Powered by OpenAlex under CC0 license.

Back to research

The Planar k-Means Problem is NP-Hard

2009316 citationsBook Chapter

Authors

Meena Mahajan · Institute of Mathematical Sciences

Prajakta Nimbhorkar · Institute of Mathematical Sciences

Kasturi Varadarajan · University of Iowa

Topics & Keywords

Computational Geometry and Mesh Generation graph theory and CDMA systems Complexity and Algorithms in Graphs

Publication Details

Published in: Lecture notes in computer science

DOI: 10.1007/978-3-642-00202-1_24

Field-Weighted Citation Impact: 25.99

The Planar k-Means Problem is NP-Hard | Researchclopedia