Metraipolis › archive › dc_7ee768059695

Recoverable robust representatives selection problem under interval continuous budgeted uncertainty — arXiv:2608.15836

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.15836
License (as archived)
CC0-1.0
Archived
2026-10-19T00:09:25.025Z
SHA-256 of the archived text
9d2edad5ac757c4be67d1bba29a4d33f7c0c12068f9e79e02fb43c6f8b2007fa
Stable URL of this page
https://metraipolis.com/documento/dc_7ee768059695

How to cite

Recoverable robust representatives selection problem under interval continuous budgeted uncertainty — arXiv:2608.15836 — arXiv (en), https://arxiv.org/abs/2608.15836 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_7ee768059695 (Metraipolis archive dc_7ee768059695, sha256 9d2edad5ac757c4be67d1bba29a4d33f7c0c12068f9e79e02fb43c6f8b2007fa)
BibTeX
@misc{dc7ee768059695,
  title = {Recoverable robust representatives selection problem under interval continuous budgeted uncertainty — arXiv:2608.15836},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.15836},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_7ee768059695; sha256 9d2edad5ac757c4be67d1bba29a4d33f7c0c12068f9e79e02fb43c6f8b2007fa},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.15836. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

In this paper, the recoverable robust representative selection problem is considered, where uncertain second-stage costs are modeled using interval uncertainty with a continuous budget. While the variant under a discrete uncertainty budget is known to be NP-hard, we show that transitioning to a continuous budget fundamentally alters the computational complexity landscape. Specifically, by exploiting the structural properties of the problem under the continuous budget model, we design a strongly polynomial-time algorithm for the general case. Furthermore, we propose an even more efficient strongly polynomial-time algorithm for an important special case.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-08-18 in cs.DS).
Categorie arXiv: Data Structures and Algorithms (cs.DS).
Pagina del lavoro: https://arxiv.org/abs/2608.15836 — 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-18T23:35:27.640Z dalla pagina https://arxiv.org/catchup/cs.DS/2026-08-18?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).