Approximation by Lexicographically Maximal Solutions in Matching and Matroid Intersection Problems

We study how good a lexicographically maximal solution is in the weighted matching and matroid intersection problems. A solution is lexicographically maximal if it takes as many heaviest elements as possible, and subject to this, it takes as many second heaviest elements as possible, and so on. If t...

Full description

Saved in:
Bibliographic Details
Main Authors Bérczi, Kristóf, Király, Tamás, Yamaguchi, Yutaro, Yokoi, Yu
Format Journal Article
LanguageEnglish
Published 21.07.2021
Subjects
Computer Science - Discrete Mathematics
Mathematics - Combinatorics
Online AccessGet full text
DOI10.48550/arxiv.2107.09897

Cover

More Information
Summary:We study how good a lexicographically maximal solution is in the weighted matching and matroid intersection problems. A solution is lexicographically maximal if it takes as many heaviest elements as possible, and subject to this, it takes as many second heaviest elements as possible, and so on. If the distinct weight values are sufficiently dispersed, e.g., the minimum ratio of two distinct weight values is at least the ground set size, then the lexicographical maximality and the usual weighted optimality are equivalent. We show that the threshold of the ratio for this equivalence to hold is exactly $2$. Furthermore, we prove that if the ratio is less than $2$, say $\alpha$, then a lexicographically maximal solution achieves $(\alpha/2)$-approximation, and this bound is tight.
DOI:10.48550/arxiv.2107.09897