Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"The planar k-means problem is NP-hard."

Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan (2012)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2010.05.034

access: open

type: Journal Article

metadata version: 2022-01-03

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/tcs/MahajanNV12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/MahajanNV12
Meena Mahajan, Prajakta Nimbhorkar, Kasturi R. Varadarajan:
The planar k-means problem is NP-hard. Theor. Comput. Sci. 442: 13-21 (2012)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.