eldorado.tu-dortmund.de/server/api/core/bitstreams/35dd3ec1-8ebf-443f-b970-76fbf17dc2e7/content
Bulk-Robust Assignment Problems: Hardness, Approximability and Algorithms
Stiller, and Rico Zenklusen. “Bulk-robust combinatorial optimization.” Mathematical Programming 149.1-2, 2015, pp. 361–390. doi: 10.1007/s10 107-014-0760-6 (cit. on pp. 1, 4, 25, 26).
[ABV05] Hassene Aissi, Cristina [...] Dániel Marx, Marcin Pilipczuk, Michał Pilipczuk, and Saket Saurabh. Parameterized Algorithms. Springer, 2015 (cit. on pp. 12, 21).
[Dah16] Mirko Dahlbeck. “Ear decompositions of matching-cov- ered graphs.” MA [...] Fabio Protti, and Aline Ribeiro de Almeida. “Robust recoverable perfect matchings.” Net- works 66.3, 2015, pp. 210–213. doi: 10.1002/net.21624 (cit. on pp. 28, 38, 90).
[DF99] Rodney G. Downey and Michael …