On maximum bipartite matching with separation

DOI10.1016/j.ipl.2023.106388arXiv2303.02283OpenAlexW4323671213MaRDI QIDQ6161448

Warut Suksompong, Pasin Manurangsi, Erel Segal-Halevi

Publication date: 5 June 2023

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2303.02283

zbMATH Keywords

approximation algorithmsbipartite matchingseparation constraint

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Unnamed Item
• A note on scheduling equal-length jobs to maximize throughput
• Polynomial time algorithms for minimizing the weighted number of late jobs on a single machine with equal processing times
• Mind the gap: cake cutting with separation
• Independent systems of representatives in weighted graphs
• On Forming Committees
• Approximating the $$k$$-Set Packing Problem by Local Improvements
• Losing Treewidth by Separating Subsets
• An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
• How to Sell Hyperedges: The Hypermatching Assignment Problem

This page was built for publication: On maximum bipartite matching with separation