License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2023.49
URN: urn:nbn:de:0030-drops-181018
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2023/18101/
Doron-Arad, Ilan ;
Kulik, Ariel ;
Shachnai, Hadas
An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets
Abstract
We study the budgeted versions of the well known matching and matroid intersection problems. While both problems admit a polynomial-time approximation scheme (PTAS) [Berger et al. (Math. Programming, 2011), Chekuri, Vondrák and Zenklusen (SODA 2011)], it has been an intriguing open question whether these problems admit a fully PTAS (FPTAS), or even an efficient PTAS (EPTAS).
In this paper we answer the second part of this question affirmatively, by presenting an EPTAS for budgeted matching and budgeted matroid intersection. A main component of our scheme is a construction of representative sets for desired solutions, whose cardinality depends only on ε, the accuracy parameter. Thus, enumerating over solutions within a representative set leads to an EPTAS. This crucially distinguishes our algorithms from previous approaches, which rely on exhaustive enumeration over the solution set.
BibTeX - Entry
@InProceedings{doronarad_et_al:LIPIcs.ICALP.2023.49,
author = {Doron-Arad, Ilan and Kulik, Ariel and Shachnai, Hadas},
title = {{An EPTAS for Budgeted Matching and Budgeted Matroid Intersection via Representative Sets}},
booktitle = {50th International Colloquium on Automata, Languages, and Programming (ICALP 2023)},
pages = {49:1--49:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-278-5},
ISSN = {1868-8969},
year = {2023},
volume = {261},
editor = {Etessami, Kousha and Feige, Uriel and Puppis, Gabriele},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2023/18101},
URN = {urn:nbn:de:0030-drops-181018},
doi = {10.4230/LIPIcs.ICALP.2023.49},
annote = {Keywords: budgeted matching, budgeted matroid intersection, efficient polynomial-time approximation scheme}
}
Keywords: |
|
budgeted matching, budgeted matroid intersection, efficient polynomial-time approximation scheme |
Collection: |
|
50th International Colloquium on Automata, Languages, and Programming (ICALP 2023) |
Issue Date: |
|
2023 |
Date of publication: |
|
05.07.2023 |