"A linear time algorithm for the robust recoverable selection problem."

Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger (2021)

> Home

Details and statistics

DOI: 10.1016/J.DAM.2020.08.012

access: closed

type: Journal Article

metadata version: 2021-10-05

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/dam/LachmannLW21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/LachmannLW21
Thomas Lachmann, Stefan Lendl, Gerhard J. Woeginger:
A linear time algorithm for the robust recoverable selection problem. Discret. Appl. Math. 303: 94-107 (2021)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.