"The Planar k-Means Problem is NP-Hard."

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

Details and statistics

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

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-03

a service of  Schloss Dagstuhl - Leibniz Center for Informatics