Incremental medians via online bidding (Q2482726): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Algorithms - ESA 2003 / 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: Local Search Heuristics for <i>k</i>-Median and Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4818873 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4527030 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Combinatorial Algorithms for Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A constant-factor approximation algorithm for the \(k\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-processor scheduling to minimize flow time with ε resource augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Oblivious Medians Via Online Bidding / rank
 
Normal rank
Property / cites work
 
Property / cites work: The reverse greedy algorithm for the metric k-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance guarantees for hierarchical clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved approximation ratio for the minimum latency problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP / 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: Speed is as powerful as clairvoyance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of a Local Search Heuristic for Facility Location Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A general approach for incremental approximation and hierarchical clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for geometric median problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Online Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonclairvoyant scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952604 / rank
 
Normal rank

Latest revision as of 21:09, 27 June 2024

scientific article
Language Label Description Also known as
English
Incremental medians via online bidding
scientific article

    Statements

    Incremental medians via online bidding (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 April 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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