Robust Randomized Matchings (Q5219560): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2776000100 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1705.06631 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the power of randomization in network interdiction / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Concavity and Intersection Properties for Integral Polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing a Knapsack of Unknown Capacity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Matchings and Matroid Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3579461 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust subgraphs for trees and paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst case analysis of greedy type algorithms for independence systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probability Inequalities for Sums of Bounded Random Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Independence Systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing knapsack solutions with cardinality robustness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized strategies for cardinality robustness in the knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized Minmax Regret for Combinatorial Optimization Under Uncertainty / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust randomized matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Instance-sensitive robustness guarantees for sequencing with unknown packing and covering constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy in Approximation Algorithms / 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: A simple PTAS for weighted matroid matching on strongly base orderable matroids / rank
 
Normal rank

Latest revision as of 01:43, 22 July 2024

scientific article; zbMATH DE number 7179759
Language Label Description Also known as
English
Robust Randomized Matchings
scientific article; zbMATH DE number 7179759

    Statements

    Robust Randomized Matchings (English)
    0 references
    0 references
    0 references
    0 references
    12 March 2020
    0 references
    robust matchings
    0 references
    randomization
    0 references

    Identifiers

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