Approximation by lexicographically maximal solutions in matching and matroid intersection problems

DOI10.1016/J.TCS.2022.01.035OpenAlexW3186337117MaRDI QIDQ2118859FDOQ2118859

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

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

Cited In (3)

• Title not available (Why is that?)
• Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems
• Minimum transversals of maximum matchings as approximate solutions to the bisection problem

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

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