The Planar k-Means Problem is NP-Hard (Q3605504): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q590541
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Kasturi R. Varadarajan / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: k-means++ / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_24 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2103718624 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q56449832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hardness of Euclidean sum-of-squares clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case and Smoothed Analysis of the ICP Algorithm, with an Application to the k-Means Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3601533 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2934696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation schemes for clustering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering large graphs via the singular value decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Metric Clustering to Minimize the Sum of Radii / rank
 
Normal rank
Property / cites work
 
Property / cites work: How fast is the \(k\)-means method? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A local search approximation algorithm for \(k\)-means clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar Formulae and Their Uses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Least squares quantization in PCM / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Some Common Geometric Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The effectiveness of lloyd-type methods for the k-means problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universality considerations in VLSI circuits / rank
 
Normal rank

Latest revision as of 01:41, 29 June 2024

scientific article
Language Label Description Also known as
English
The Planar k-Means Problem is NP-Hard
scientific article

    Statements

    Identifiers