A Linear Time Algorithm for Selection with Intersection Constraints with Applications to the Recoverable Robust Selection and Representative Selection Problem with Interval Uncertainties (bibtex)
by Thomas Lachmann, Stefan Lendl
Reference:
Thomas Lachmann, Stefan Lendl, A Linear Time Algorithm for Selection with Intersection Constraints with Applications to the Recoverable Robust Selection and Representative Selection Problem with Interval Uncertainties, (2018). (preprint)
Bibtex Entry:
@misc{lendl-robustselection,
	title = "A Linear Time Algorithm for Selection with
            Intersection Constraints with Applications to
            the Recoverable Robust Selection and
            Representative Selection Problem with
            Interval Uncertainties",
	author = "Thomas Lachmann and Stefan Lendl",
	year = 2018,
	note = "preprint",
}