Preclustering algorithms for imprecise points (Q2144264): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Mark T. de Berg / rank
Normal rank
 
Property / author
 
Property / author: Mark T. de Berg / 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/s00453-022-00929-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4210885240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact and approximation algorithms for clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542527 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Are Stable Instances Easy? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing imprecise points for Delaunay triangulation: simplified and extended / rank
 
Normal rank
Property / cites work
 
Property / cites work: A PTAS for k-means clustering based on weak coresets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Best Possible Heuristic for the <i>k</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simple D 2-Sampling Based PTAS for k-Means and other Clustering Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest area convex hull of imprecise data based on axis-aligned squares / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimizing the diameter of a spanning tree for imprecise points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest and smallest convex hulls for imprecise points / rank
 
Normal rank
Property / cites work
 
Property / cites work: The planar \(k\)-means problem is NP-hard / 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: Q4547814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Separability of imprecise points / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exponential lower bound for the translative kissing numbers of \(d\)-dimensional convex bodies / rank
 
Normal rank

Latest revision as of 05:18, 29 July 2024

scientific article
Language Label Description Also known as
English
Preclustering algorithms for imprecise points
scientific article

    Statements

    Preclustering algorithms for imprecise points (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    1 June 2022
    0 references
    0 references
    computational geometry
    0 references
    clustering
    0 references
    imprecise points
    0 references
    0 references