Geometric rounding: A dependent randomized rounding scheme (Q411220): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Pipage rounding: a new method of constructing algorithms with proven performance guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4471294 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rounding algorithms for covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analysis of LP relaxations for multiway and multicut problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On dependent randomized rounding algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4542519 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hub Location and the <i>p</i>-Hub Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2768280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3723577 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for combinatorial auctions with complement-free bidders / rank
 
Normal rank
Property / cites work
 
Property / cites work: A threshold of ln <i>n</i> for approximating set cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dependent rounding and its applications to approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4400840 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique is hard to approximate within \(n^{1-\epsilon}\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for the Set Covering and Vertex Cover Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for classification problems with pairwise relationships / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579410 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for the Hub Location Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic construction of deterministic algorithms: approximating packing integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized rounding: A technique for provably good algorithms and algorithmic proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3412561 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximation algorithm for the generalized assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4875163 / rank
 
Normal rank

Latest revision as of 01:57, 5 July 2024

scientific article
Language Label Description Also known as
English
Geometric rounding: A dependent randomized rounding scheme
scientific article

    Statements

    Geometric rounding: A dependent randomized rounding scheme (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 April 2012
    0 references
    integer programming
    0 references
    linear programming
    0 references
    approximation algorithm
    0 references
    randomized rounding
    0 references

    Identifiers