An improved approximation algorithm for knapsack median using sparsification (Q1751085): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: An Improved Approximation for <i>k</i>-median, and Positive Correlation in Budgeted Optimization / 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 Dependent LP-Rounding Approach for the k-Median 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: 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: Q5365103 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743439 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating k-median via pseudo-approximation / 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: The Design of Approximation Algorithms / rank
 
Normal rank

Latest revision as of 17:04, 15 July 2024

scientific article
Language Label Description Also known as
English
An improved approximation algorithm for knapsack median using sparsification
scientific article

    Statements

    An improved approximation algorithm for knapsack median using sparsification (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 May 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithm
    0 references
    combinatorial optimization
    0 references
    randomized algorithm
    0 references
    facility-location problems
    0 references
    0 references