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)
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C85: Graph algorithms (graph-theoretic aspects)
Related Items
Packing a Knapsack of Unknown Capacity, Robust Independence Systems, An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes, Approximation algorithms for maximum latency and partial cycle cover, Approximation algorithms for the metric maximum clustering problem with given cluster sizes., Computing knapsack solutions with cardinality robustness