Robust Matchings
From MaRDI portal
Publication:4785699
DOI10.1137/S0895480198332156zbMath1006.05051MaRDI QIDQ4785699
Refael Hassin, Shlomi Rubinstein
Publication date: 5 January 2003
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (13)
Packing a Knapsack of Unknown Capacity ⋮ An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes ⋮ Randomized strategies for cardinality robustness in the knapsack problem ⋮ Computing knapsack solutions with cardinality robustness ⋮ Randomized strategies for robust combinatorial optimization with approximate separation ⋮ Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows ⋮ Surrogate optimization for \(p\)-norms ⋮ Robust Independence Systems ⋮ Approximation algorithms for maximum latency and partial cycle cover ⋮ Robust Randomized Matchings ⋮ Approximation algorithms for the metric maximum clustering problem with given cluster sizes. ⋮ Fractionally subadditive maximization under an incremental knapsack constraint ⋮ General bounds for incremental maximization
This page was built for publication: Robust Matchings
