Improved Approximation Algorithms for Stochastic Matching (Q3452763): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Improved analysis of the greedy algorithm for stochastic matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Stochastic Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Submodular Stochastic Probing on Matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: When LP is the cure for your matching woes: improved bounds for stochastic matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Matches Made in Heaven / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Stochastic Knapsack Problem: The Benefit of Adaptivity / 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: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank

Latest revision as of 02:13, 11 July 2024

scientific article
Language Label Description Also known as
English
Improved Approximation Algorithms for Stochastic Matching
scientific article

    Statements

    Identifiers

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