Graphentheoretische Konzepte und Algorithmen SO Krumke, H Noltemeier Vieweg+ Teubner, 2009 | 244 | 2009 |
Models and approximation algorithms for channel assignment in radio networks SO Krumke, MV Marathe, SS Ravi Wireless networks 7, 575-584, 2001 | 204 | 2001 |
Online dial-a-ride problems: Minimizing the completion time N Ascheuer, SO Krumke, J Rambau STACS 2000: 17th Annual Symposium on Theoretical Aspects of Computer Science …, 2000 | 194 | 2000 |
Online optimization of large scale systems M Grötschel, SO Krumke, J Rambau Springer Science & Business Media, 2013 | 191 | 2013 |
On the minimum label spanning tree problem SO Krumke, HC Wirth Information Processing Letters 66 (2), 81-85, 1998 | 140 | 1998 |
The online TSP against fair adversaries M Blom, SO Krumke, WE de Paepe, L Stougie INFORMS Journal on Computing 13 (2), 138-148, 2001 | 110 | 2001 |
The online dial-a-ride problem under reasonable load D Hauptmeier, SO Krumke, J Rambau Italian Conference on Algorithms and Complexity, 125-136, 2000 | 106 | 2000 |
News from the online traveling repairman SO Krumke, WE De Paepe, D Poensgen, L Stougie Theoretical Computer Science 295 (1-3), 279-294, 2003 | 93 | 2003 |
Online optimization: Competitive analysis and beyond S Krumke | 85 | 2002 |
The generalized assignment problem with minimum quantities SO Krumke, C Thielen European Journal of Operational Research 228 (1), 46-55, 2013 | 81 | 2013 |
Approximation algorithms for certain network improvement problems SO Krumke, MV Marathe, H Noltemeier, R Ravi, SS Ravi Journal of Combinatorial Optimization 2, 257-288, 1998 | 77 | 1998 |
A decomposition-based pseudoapproximation algorithm for network flow inhibition C Burch, R Carr, S Krumke, M Marathe, C Phillips, E Sundberg Network Interdiction and Stochastic Integer Programming, 51-68, 2003 | 75 | 2003 |
Real-time dispatching of guided and unguided automobile service units with soft time windows SO Krumke, J Rambau, LM Torres European Symposium on Algorithms, 637-648, 2002 | 70 | 2002 |
On a generalization of the p-center problem SO Krumke Information processing letters 56 (2), 67-71, 1995 | 70 | 1995 |
Combinatorial online optimization in real time M Grötschel, SO Krumke, J Rambau, T Winter, UT Zimmermann Online optimization of large scale systems, 679-704, 2001 | 67 | 2001 |
Non-abusiveness Helps: An O (1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem. SO Krumke, L Laura, M Lipmann, A Marchetti-Spaccamela, W de Paepe, ... APPROX, 200-214, 2002 | 55 | 2002 |
On minimizing the maximum flow time in the online dial-a-ride problem SO Krumke, WE de Paepe, D Poensgen, M Lipmann, ... Approximation and Online Algorithms: Third International Workshop, WAOA 2005 …, 2006 | 53 | 2006 |
Flow improvement and network flows with fixed costs SO Krumke, H Noltemeier, S Schwarz, HC Wirth, R Ravi Operations Research Proceedings 1998: Selected Papers of the International …, 1999 | 51 | 1999 |
Topology control problems under symmetric and asymmetric power thresholds SO Krumke, R Liu, EL Lloyd, MV Marathe, R Ramanathan, SS Ravi Ad-Hoc, Mobile, and Wireless Networks: Second International Conference …, 2003 | 48 | 2003 |
Combinatorial online optimization N Ascheuer, M Grötschel, SO Krumke, J Rambau Operations Research Proceedings 1998: Selected Papers of the International …, 1999 | 47 | 1999 |