The reverse greedy algorithm for the metric k-median problem (Q1045901): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Import241208061232 (talk | contribs)
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2005.09.009 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2161747341 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: cs/0504104 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search heuristic for k-median and facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incremental Clustering and Dynamic Information Retrieval / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-factor approximation algorithm for the <i>k</i> -median problem (extended abstract) / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new greedy approach for facility location problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for metric facility location and <i>k</i> -Median problems using the primal-dual schema and Lagrangian relaxation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for hierarchical location problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2005.09.009 / rank
 
Normal rank

Latest revision as of 14:49, 10 December 2024

scientific article
Language Label Description Also known as
English
The reverse greedy algorithm for the metric k-median problem
scientific article

    Statements

    The reverse greedy algorithm for the metric k-median problem (English)
    0 references
    0 references
    0 references
    0 references
    18 December 2009
    0 references
    analysis of algorithms
    0 references
    approximation algorithms
    0 references
    online algorithms
    0 references
    facility location
    0 references
    combinatorial optimization
    0 references

    Identifiers