Metraipolis › archive › dc_2d6c41f0ff36
A Reusable Framework for Robust Approximation Algorithms in the Interval Uncertainty Model — arXiv:2609.11621
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2609.11621
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-16T06:39:29.215Z
- SHA-256 of the archived text
29a51bb42be689acca1badbdbaaa50772136554ac573bee793bff6518a52e222- Stable URL of this page
https://metraipolis.com/documento/dc_2d6c41f0ff36
How to cite
A Reusable Framework for Robust Approximation Algorithms in the Interval Uncertainty Model — arXiv:2609.11621 — arXiv (en), https://arxiv.org/abs/2609.11621 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2d6c41f0ff36 (Metraipolis archive dc_2d6c41f0ff36, sha256 29a51bb42be689acca1badbdbaaa50772136554ac573bee793bff6518a52e222)
BibTeX
@misc{dc2d6c41f0ff36,
title = {A Reusable Framework for Robust Approximation Algorithms in the Interval Uncertainty Model — arXiv:2609.11621},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2609.11621},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2d6c41f0ff36; sha256 29a51bb42be689acca1badbdbaaa50772136554ac573bee793bff6518a52e222},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11621. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Robust optimization under interval uncertainty aims to compute solutions that perform well on a range of scenarios that are described by interval-constrained costs. In this paper, we revisit a framework introduced by Ganesh, Maggs and Panigrahi in 2020 to study the robust optimization of NP-hard problems under interval uncertainty. We start by generalizing a result in the $\ell=0$ case, which transforms a category of approximation algorithms into a robust approximation algorithm. Furthermore, in the general case, we provide a theorem that turns any local search-based approximation algorithm into a robust approximation algorithm under three newly formalized conditions over the moves of the local search algorithm. We then use this result to present the first robust approximation algorithm for Weighted $k$-Set Cover, the third NP-hard problem known to admit a robust approximation, and the first since the publication of Ganesh, Maggs and Panigrahi's paper. Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in cs.DS). Categorie arXiv: Data Structures and Algorithms (cs.DS). Pagina del lavoro: https://arxiv.org/abs/2609.11621 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-16T06:16:40.978Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).