New Algorithms for k-Center and Extensions (Q5505644): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1559325037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4250235 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4054519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a set of points by two axis-parallel boxes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Excursions into combinatorial geometry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal containment under homothetics: a simple cutting plane approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate clustering via core-sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: More planar two-center algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5501789 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering to minimize the maximum intercluster distance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inner and outer \(j\)-radii of convex bodies in finite-dimensional normed spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some basic problems in computational convexity. I. Containment problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 2-Center Problem with Obstacles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4148820 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster algorithm for the two-center decision problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple linear algorithm for computing rectilinear 3-centers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3994557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5791470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3348736 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of some geometric problems in unbounded dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using SeDuMi 1.02, A Matlab toolbox for optimization over symmetric cones / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the continuous space p-centre problem: planning application issues / rank
 
Normal rank

Latest revision as of 23:53, 28 June 2024

scientific article; zbMATH DE number 5498444
Language Label Description Also known as
English
New Algorithms for k-Center and Extensions
scientific article; zbMATH DE number 5498444

    Statements

    New Algorithms for k-Center and Extensions (English)
    0 references
    0 references
    0 references
    27 January 2009
    0 references
    approximation algorithms
    0 references
    branch-and-bound
    0 references
    computational geometry
    0 references
    geometric inequalities
    0 references
    containment
    0 references
    core-sets
    0 references
    \(k\)-center
    0 references
    diameter partition
    0 references
    SOCP
    0 references
    2-SAT
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references