Approximation by lexicographically maximal solutions in matching and matroid intersection problems

DOI10.1016/j.tcs.2022.01.035OpenAlexW3186337117MaRDI QIDQ2118859

Yu Yokoi, Kristóf Bérczi, Yutaro Yamaguchi, Tamás Király

Publication date: 23 March 2022

Published in: Theoretical Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

matchingmatroid intersectionapproximation ratiolexicographical maximality

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites Work

• Unnamed Item
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Exact and approximation algorithms for weighted matroid intersection
• Reducing rank-maximal to maximum weight matching
• Rank-maximal matchings
• Matroid intersection algorithms
• An Analysis of the Greedy Heuristic for Independence Systems
• MATROID INTERSECTION WITH PRIORITY CONSTRAINTS

This page was built for publication: Approximation by lexicographically maximal solutions in matching and matroid intersection problems