A linear time algorithm for the robust recoverable selection problem (bibtex)

by Thomas Lachmann, Stefan Lendl and Gerhard J. Woeginger

Reference:

Thomas Lachmann, Stefan Lendl and Gerhard J. Woeginger, A linear time algorithm for the robust recoverable selection problem, Discrete Applied Mathematics, 303, 94–107, (2021).

Bibtex Entry:

@Article{LachmannEtAl2021,
  author  = {Thomas Lachmann and Stefan Lendl and Gerhard J. Woeginger},
  journal = {Discrete Applied Mathematics},
  title   = {A linear time algorithm for the robust recoverable selection problem},
  year    = {2021},
  oatype  = {Hybrid},
  issn    = {0166-218X},
  pages   = {94--107},
  volume  = {303},
  doi     = {10.1016/j.dam.2020.08.012},
  groups  = {Project07 (Klinz), Student, External},
  xxurl   = {http://www.sciencedirect.com/science/article/pii/S0166218X20303759},
}