Robust Matchings

DOI10.1137/S0895480198332156MaRDI QIDQ4785699zbMATH OpenFDO

Authors Refael Hassin, Shlomi Rubinstein

Publication date 5 January 2003

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0895480198332156

zbMATH Keywords

maximum clusteringrobust matching

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• scientific article; zbMATH DE number 1617264
• scientific article; zbMATH DE number 795216
• Robust matchings and matroid intersections
• Robust matchings and matroid intersections
• On the existence of weak greedy matching heuristics

Cited in

(16)

• Approximation algorithms for maximum latency and partial cycle cover
• Randomized strategies for cardinality robustness in the knapsack problem
• Approximation algorithms for the metric maximum clustering problem with given cluster sizes.
• Computing knapsack solutions with cardinality robustness
• Surrogate optimization for \(p\)-norms
• Fractionally subadditive maximization under an incremental knapsack constraint
• General bounds for incremental maximization
• scientific article; zbMATH DE number 1617264 (Why is no real title available?)
• Maintaining perfect matchings at low cost
• Robust randomized matchings
• Packing a knapsack of unknown capacity
• Robust independence systems
• Robust matchings and matroid intersections
• Randomized strategies for robust combinatorial optimization with approximate separation
• Fractionally Subadditive Maximization under an Incremental Knapsack Constraint with Applications to Incremental Flows
• An improved approximation algorithm for the metric maximum clustering problem with given cluster sizes

This page was built for publication: Robust Matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4785699)