Robust matchings and maximum clustering

DOI10.1007/3-540-44985-X_23MaRDI QIDQ2721984zbMATH OpenFDO

Authors Refael Hassin, Shlomi Rubinstein

Publication date 11 July 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-44985-X_23

Mathematics Subject Classification ID

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

Recommendations

• Robust randomized matchings
• Robust randomized matchings
• Robust Matchings
• Robust matchings and matroid intersections
• Robust matchings and matroid intersections
• Robust recoverable perfect matchings
• Algorithms for stable matching and clustering in a grid
• A Game-Theoretic Approach to Pairwise Clustering and Matching
• Tight bounds on maximal and maximum matchings
• Tight bounds on maximal and maximum matchings

Cited in

(4)

• Approximating the maximum quadratic assignment problem
• Robust Matchings
• POSITIVE SKILL CLUSTERING IN ROLE‐ASSIGNMENT MATCHING MODELS
• Cluster expansion formulas and perfect matchings

This page was built for publication: Robust matchings and maximum clustering

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