 | Up a level |
Gairing, Martin, Harks, Tobias and Klimm, Max
(2013)
Complexity and Approximation of the Continuous Network Design Problem.
In:
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, APPROX/RANDOM 2014, September 4-6, 2014, Barcelona, Spain.
LIPIcs, 28
.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, pp. 226-241.
ISBN 9783939897743
Gairing, Martin and Klimm, Max
(2019)
Greedy Metric Minimum Online Matchings with Random Arrivals.
Operations Research Letters, 47 (2).
pp. 88-91.
Disser, Yann, Fearnley, John, Gairing, M, Goebel, Oliver, Klimm, Max, Schmand, Daniel, Skopalik, Alexander and Toennis, Andreas
(2020)
Hiring Secretaries over Time: The Benefit of Concurrent Employment.
Mathematics of Operations Research, 45 (1).
pp. 323-352.