A linear time algorithm for the robust recoverable selection problem

Thomas Lachmann, Stefan Lendl*, Gerhard J. Woeginger

*Corresponding author for this work

Research output: Contribution to journalArticle

Abstract

The feasible solutions in the robust recoverable selection problem are subsets of size p that are to be selected from a ground set of size n. The objective is to construct a feasible solution in two sequential stages with two separate (but interleaved) cost structures. The fastest algorithm for this problem in the literature up to now has quadratic running time. We improve on this by developing an algorithm with linear running time.

Original languageEnglish
Number of pages14
JournalDiscrete Applied Mathematics
Early online dateSep 2020
DOIs
Publication statusE-pub ahead of print - Sep 2020

Keywords

  • Computational complexity
  • Robust optimization
  • Selection problem

ASJC Scopus subject areas

  • Applied Mathematics
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'A linear time algorithm for the robust recoverable selection problem'. Together they form a unique fingerprint.

Cite this