A linear time algorithm for the robust recoverable selection problem

Thomas Lachmann, Stefan Lendl*, Gerhard J. Woeginger

*Korrespondierende/r Autor/in für diese Arbeit

Publikation: Beitrag in einer FachzeitschriftArtikel

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.

Originalspracheenglisch
Seitenumfang14
FachzeitschriftDiscrete Applied Mathematics
Frühes Online-DatumSep 2020
DOIs
PublikationsstatusElektronische Veröffentlichung vor Drucklegung. - Sep 2020

ASJC Scopus subject areas

  • Angewandte Mathematik
  • !!Discrete Mathematics and Combinatorics

Fingerprint Untersuchen Sie die Forschungsthemen von „A linear time algorithm for the robust recoverable selection problem“. Zusammen bilden sie einen einzigartigen Fingerprint.

Dieses zitieren