The Euclidean <i>k</i>-Supplier Problem (Q5108254): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Normalize DOI.
 
(One intermediate revision by one other user not shown)
Property / DOI
 
Property / DOI: 10.1287/moor.2018.0953 / rank
Normal rank
 
Property / cites work
 
Property / cites work: Centrality of trees for capacitated \(k\)-center / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm for approximate nearest neighbor searching fixed dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Data Placement Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate nearest neighbor queries revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroid and knapsack center problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5431814 / 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: On coresets for k-means and k-median clustering / 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: The Capacitated <i>K</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Linear-Time Approximation Scheme for the Euclidean <i>k</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facility Location with Matroid or Knapsack Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matchings in planar graphs via Gaussian elimination / rank
 
Normal rank
Property / cites work
 
Property / cites work: AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Matroid and Knapsack Median Problems and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate minimum weight matching on points in k-dimensional space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometry Helps in Matching / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/MOOR.2018.0953 / rank
 
Normal rank

Latest revision as of 15:57, 30 December 2024

scientific article; zbMATH DE number 7195310
Language Label Description Also known as
English
The Euclidean <i>k</i>-Supplier Problem
scientific article; zbMATH DE number 7195310

    Statements

    The Euclidean <i>k</i>-Supplier Problem (English)
    0 references
    0 references
    0 references
    0 references
    30 April 2020
    0 references
    analysis of algorithms: suboptimal algorithms
    0 references
    approximation algorithms
    0 references
    facility location
    0 references

    Identifiers

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