AG Optimierung

Prof. Dr. Sven O. Krumke

Anschrift

Paul-Ehrlich-Straße
Gebäude 14 , Raum 434
67663 Kaiserslautern

Postfach 3049
67653 Kaiserslautern

Kontakt

Tel.: +49 631 205 4808
Fax: +49 631 205 4737
E-Mail: krumke@mathematik.uni-kl.de


Curriculum Vitae

  • 1988-1994: Studium der Mathematik und Informatik an der Universität Würzburg

  • 1992-1993: Austauschstudent am Fachbereich Informatik an der State University of New York at Albany, teilweise gefördert durch die German-American Fulbright Commission.

  • 1994: Master in Mathematik (Diplom), Universität Würzburg
    Abschlussarbeit: Eine modifizierte Barrieremethode für konvexe quadratische Optimierungsprobleme
    Advisor: Josef Stoer

  • 1994-1998: Wiss. Mitarbeiter am Lehrstuhl für Informatik I an der Universität Würzburg

  • 1997: Promotion (Dr.rer.nat.), Universität Würzburg
    Thesis: On the Approximability of Location and Network Design Problems
    Committee: Hartmut Noltemeier, Josef Stoer

  • 1998-2004: Wiss. Mitarbeiter in der Abteilung Optimierung am Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)

  • 2002: Habilitation, Technische Universität Berlin
    Thesis: Online Optimization: Competitive Analysis and Beyond
    Committee: Martin Grötschel, Susanne Albers, Gerhard J. Woeginger

  • 2004 - heute: Professor im Fachbereich Mathematik an der Technischen Universität Kaiserslautern 

Forschungsinteressen

Meine Forschungsinteressen beinhalten unter anderem:

  • Kombinatorische Optimierung
  • Approximationsalgorithmen
  • Online-Algorithmen
  • Komplexität
  • Algorithmische Spieltheorie 
  • Graphtheorie und Anwendungen

Aktuelle Vorlesungen

Im aktuellen Semester biete ich folgende Vorlesung an:

Integer Programming (Ganzzahlige Optimierung)

Veröffentlichungen

  • An FPTAS for the knapsack problem with parametric weights
    N. Halman, M. Holzhauser, S. O. Krumke,
    Operations Research Letters 46, pp. 487-491 (2018)

  • A Generalized Approximation Framework for Fractional Network Flow and Packing Problems
    M. Holzhauser, S. O. Krumke,
    Mathematical Methods of Operations Research 87, pp. 19-50 (2018)

  • On the Complexity and Approximability of Budget-Constrained Minimum Cost Flows
    M. Holzhauser, S. O. Krumke, C. Thielen,
    Information Processing Letters 126, pp. 24-29 (2017)

  • An FPTAS for the parametric knapsack problem
    M. Holzhauser, S. O. Krumke,
    Information Processing Letter 126, pp. 43-47 (2017)

  • A Network Simplex Method for the Budget-Constrained Minimum Cost Flow Problem
    M. Holzhauser, S. O. Krumke, C. Thielen,
    European Journal of Operational Research 259, pp. 864-872 (2017)

  • Maximum Flows in Generalized Processing Networks
    M. Holzhauser, S. O. Krumke, C. Thielen,
    Journal of Combinatorial Optimization 33, pp. 1226-1256 (2017)

  • Capacitated Network Design Games with Weighted Players
    A. Chassein, S. O. Krumke, C. Thielen,
    Networks 68, pp. 141-158 (2016)

  • Budget-Constrained Minimum Cost Flows
    M. Holzhauser, S. O. Krumke, C. Thielen,
    Journal of Combinatorial Optimization 31, pp. 1720-1745 (2016)

  • The Canadian Tour Operator Problem on Paths - Tight Bounds and Resource Augmentation
    S. Büttner, S. O. Krumke,
    Journal of Combinatorial Optimization (2015)

  • Robust Optimization for Routing Problems on Trees
    S. Büttner, S. O. Krumke,
    TOP: An Official Journal of the Spanish Society of Statistics and Operations Research (2015)

  • Convex Generalized Flows
    M. Holzhauser, S. O. Krumke, C. Thielen,
    Discrete Applied Mathematics 190-191, pp. 86-99 (2015)

  • Static and dynamic source locations in undirected networks
    L. Turner, D P. Gross, H. W. Hamacher, S. O. Krumke,
    TOP: An Official Journal of the Spanish Society of Statistics and Operations Research 23 (2015)

  • Robust Bottleneck Routing Games
    T. L. Werth, S. Büttner, S. O. Krumke,
    Networks 66, pp. 57-66 (2015)

  • Rejoinder on: Static and dynamic source locations in undirected networks
    L. Turner, D. Groß, H. W. Hamacher, S. O. Krumke,
    TOP 23, pp. 665-668 (2015)

  • On the Online Min-Wait Relocation Problem
    P. Halffmann, S. O. Krumke, A. Quilliot, A. K. Wagler, J. Wegener,
    Electronic Notes in Discrete Mathematics 50, pp. 281 - 286 (2015)

  • Computation of equilibria and the price of anarchy in bottleneck congestion games
    T. L. Werth, H. Sperber, S. O. Krumke,
    Central European Jurnal of Operations Research 22, pp. 687-712 (2014)

  • Atomic routing in a deterministic queuing model
    T. L. Werth, M. Holzhauser, S. O. Krumke,
    Operations Research Perspectives 1, pp. 18-41 (2014)

  • Online delay management on a single train line: beyond competitive analysis
    M. Bender, S. Büttner, S. O. Krumke,
    Public Transport 5, pp. 243-266 (2013)

  • The Generalized Assignment Problem with Minimum Quantities
    S. O. Krumke, C. Thielen,
    European Journal of Operational Research 228, pp. 46-55 (2013)

  • Generalized Max Flow in Series-Parallel Graphs
    S. O. Krumke, C. Zeck,
    Discrete Optimization 10, pp. 155-162 (2013)

  • Stability with Uniform Bounds for On-Line Dial-a-Ride Problems under Reasonable Load
    S. O. Krumke, J. Rambau,
    Lecture Notes in Control and Information Sciences 417, pp. 387-412 (2012)

  • Selfish Bincoloring
    L. Epstein, S. O. Krumke, A. Levin, H. Sperber,
    Journal of Combinatorial Optimization 22, pp. 531-548 (2011)

  • Extensions to Online Delay Management on a Single Train Line: New Bounds for Delay Minimization and Profit Maximization
    S. O. Krumke, C. Thielen, C. Zeck,
    Mathematical Methods of Operations Research 74, pp. 53-75 (2011)

  • Interval Scheduling on Related Machines
    S. O. Krumke, C. Thielen, S. Westphal,
    Computers and Operations Research 38, pp. 1836-1844 (2011)

  • Minimum Cost Flows with Minimum Quantities
    S. O. Krumke, C. Thielen,
    Information Processing Letters 111, pp. 533-537 (2011)

  • Online Scheduling of Weighted Equal-Length Jobs with Hard Deadlines on Parallel Machines
    S. O. Krumke, S. Westphal, A. Taudes,
    Computers and Operations Research 38, pp. 1103-1108 (2011)

  • Truthful Mechanisms for Selfish Routing and Two-Parameter Agents
    C. Thielen, S. O. Krumke,
    Theory of Computing Systems 49, pp. 196-223 (2011)

  • Clever or Smart: Strategies for the online target date assignment problem
    E. Gassner, J. Hatzl, S. O. Krumke, S. Saliba,
    Discrete Applied Mathematics 158, pp. 71-79 (2010)

  • New lower bounds for online $k$-server routing problems
    I. Fink, S. O. Krumke, S. Westphal,
    Information Processing Letters 109, pp. 563-567 (2009)

  • How hard is it to find extreme Nash equilibria in congestion games?
    E. Gassner, J. Hatzl, S. O. Krumke, H. Sperber, G J. Woeginger,
    Theoretical Computer Science 410, pp. 4989-4999 (2009)

  • A monotone approximation algorithm for scheduling with precedence constraints
    S O. Krumke, A. Schwahn, R. Stee, S. Westphal,
    Operations Research Letters 36, pp. 247-249 (2008)

  • Semi-Preemptive Routing on Trees
    S O. Krumke, D. Räbiger, R. Schrader,
    Discrete Applied Mathematics 156, pp. 3298-3304 (2008)

  • Bincoloring
    S O. Krumke, W E. Paepe, L. Stougie, J. Rambau,
    Theoretical Computer Science 407, pp. 231-241 (2008)

  • Approximation Algorithms for a vehicle routing problem
    S O. Krumke, S. Saliba, T. Vredeveld, S. Westphal,
    Mathematical Methods of Operations Research 68, pp. 333-359 (2008)

  • Pruning in Column Generation for service vehicle dispatching
    S. Westphal, S O. Krumke,
    Annals of Operations Research 159, pp. 355-371 (2008)

  • Erratum to News from the online traveling repairman
    S O. Krumke, W E. Paepe, D. Poensgen, L. Stougie,
    Theoretical Computer Science 352, pp. 347-348 (2006)

  • How to whack moles
    S. Gutiérrez, S O. Krumke, N. Megow, T. Vredeveld,
    Theoretical Computer Science 361, pp. 329-341 (2006)

  • Reoptimization gaps versus model errors in online-dispatching of service units for ADAC
    B. Hiller, S O. Krumke, J. Rambau,
    Discrete Applied Mathematics 154, pp. 1897-1907 (2006)

  • A heuristic for the Stacker Crane Problem on trees which is almost surely exact
    A. Coja-Oghlan, S O. Krumke, T. Nierhoff,
    Journal of Algorithms 61, pp. 1-19 (2006)

  • A hard dial-a-ride problem that is easy on average
    A. Coja-Oghlan, S O. Krumke, T. Nierhoff,
    Journal on Scheduling 8, pp. 197-210 (2005)

  • The Online Dial-a-Ride Problem under Reasonable Load
    D. Hauptmeier, S O. Krumke, J. Rambau,
    Theoretical Commputer Science (2004)

  • Budget Constrained Minimum Cost Connected Medians
    G. Konjevod, S O. Krumke, M V. Marathe,
    Journal of Discrete Algorithms 2, pp. 453-469 (2004)

  • News from the Online Traveling Repairman
    S O. Krumke, W E. Paepe, D. Poensgen, L. Stougie,
    295, pp. 279-294 (2003)

  • Making the yellow angels fly: Online Dispatching of service vehicles in real time
    M. Grötschel, S O. Krumke, J. Rambau, L M. Torres,
    SIAM news 35, pp. 10-11 (2002)

  • Probieren geht über Studieren? Entscheidungshilfen für kombinatorische Online-Optimierungsprobleme in der innerbetrieblichen Logistik
    S O. Krumke, J. Rambau,
    at - Automatisierungstechnik 12, pp. 568-575 (2002)

  • The Online-TSP Against Fair Adversaries
    M. Blom, S O. Krumke, W E. Paepe, L. Stougie,
    Informs Journal on Computing 13, pp. 138-148 (2001)

  • Euler is standing in line
    D. Hauptmeier, S O. Krumke, J. Rambau, H -C. Wirth,
    Discrete Applied Mathematics 113, pp. 87-107 (2001)

  • Models and Approximation Algorithms for Channel Assignment in Radio Networks
    S O. Krumke, M V. Marathe, S S. Ravi,
    Wireless Networks 7, pp. 575-584 (2001)

  • Upgrading Bottleneck Constrained Forests
    S O. Krumke, M V. Marathe, H. Noltemeier, S S. Ravi, H -C. Wirth,
    Discrete Applied Mathematics 108, pp. 129-142 (2001)

  • Network Design and Network Improvement
    H. Noltemeier, H -C. Wirth, S O. Krumke,
    ACM Computing Surveys 31 (1999)

  • Wo bleibt der Aufzug?
    M. Grötschel, S O. Krumke, J. Rambau,
    OR News, pp. 11-13 (1999)

  • Improving Spanning Trees by Upgrading Nodes
    S O. Krumke, M V. Marathe, H. Noltemeier, R. Ravi, S S. Ravi, R. Sundaram, H -C. Wirth,
    Theoretical Computer Science 221, pp. 139-155 (1999)

  • Improving Minimum Cost Spanning Trees by Upgrading Nodes
    S O. Krumke, M V. Marathe, H. Noltemeier, R. Ravi, S S. Ravi, R. Sundaram, H C. Wirth,
    Journal of Algorithms 33, pp. 92-111 (1999)

  • Approximation Algorithms for Certain Network Improvement Problems
    S O. Krumke, M V. Marathe, H. Noltemeier, R. Ravi, S S. Ravi,
    Journal of Combinatorial Optimization 2, pp. 257-288 (1998)

  • On the Minimum Label Spanning Tree Problem
    S O. Krumke, H -C. Wirth,
    Information Processing Letters 66, pp. 81-85 (1998)

  • On Budget Constrained Flow Improvement
    S. Schwarz, S O. Krumke,
    Information Processing Letters 66, pp. 291-297 (1998)

  • Modifying Networks to obtain low cost subgraphs
    S O. Krumke, H. Noltemeier, S S. Ravi, M V. Marathe, K U. Drangmeister,
    Theoretical Computer Science 203, pp. 91-121 (1998)

  • Compact Location Problems
    S O. Krumke, M V. Marathe, H. Noltemeier, V. Radhakrishnan, S S. Ravi, D J. Rosenkrantz,
    Theoretical Computer Science 181, pp. 379-404 (1997)

  • Finding Placement Sequences and Bin Locations for Pick and Place Robots
    C. Mauckner, H. Noltemeier, S O. Krumke,
    Studies in Locational Analysis 10, pp. 67-89 (1996)

  • Bicriteria Compact Location Problems
    S O. Krumke, H. Noltemeier, S S. Ravi, M V. Marathe,
    Studies in Locational Analysis 10, pp. 37-51 (1996)

  • On a Generalization of the p-Center Problem
    S O. Krumke,
    Information Processing Letters 56, pp. 67-71 (1995)
  • Graphentheorische Konzepte und Algorithmen
    S O. Krumke, H. Noltemeier,
    B.G. Teubner, (2012)

  • ConGen: An Application Specific DRAM Memory Controller Generator
    M. Jung, D. M. Mathew, C. Weis, W. Norbert, I. Heinrich, M. V. Natale, S. O. Krumke,
    Proceedings of the Second International Symposium on Memory Systems, pp. 257-267 (2016)

  • On the Online Min-Wait Relocation Problem
    P. Halffmann, S. O. Krumke, A. Quilliot, A. Wagler, J. Wegener,
    Proceedings of the VIII Latin-American Algorithms, Graphs, and Optimization Symposium, Electronic Notes in Discrete Mathematics (2015)

  • Being Negative Makes Life NP-hard (for Product Sellers)
    S. O. Krumke, F. D. Schwahn, C. Thielen,
    Proceedings of the 7th International Conference on Fun with Algorithms (FUN), LNCS (8496), pp. 277-288 (2014)

  • Relocation in Carsharing Systems using Flows in Time-Expanded Networks
    S. O. Krumke, A. Quilliot, A. Wagler, J. Wegener,
    Proceedings of the 5th Annual International Conference on Software Engineering & Applications, LNCS (8504), pp. 87-98 (2014)

  • Models and Algorithms for Carsharing Systems and Related Problems
    S. O. Krumke, A. Quilliot, A. Wagler, J. Wegener,
    Proceedings of the VII Latin-American Algorithms, Graphs, and Optimization Symposium, Electronic Notes in Discrete Mathematics (44), pp. 201-206 (2013)

  • Optimierte Abstimmung der Umsteigebeziehungen im ungetakteten ÖPNV unter Berücksichtigung der Umlaufplanung
    N. Leithäuser, I. Schüle, S. O. Krumke,
    Multikonferenz Wirtschaftsinformatik 2012 (2012)

  • Approximating Infeasible 2VPI-Systems
    N. Leithäuser, S. O. Krumke, M. Merkert,
    Proceedings of the 38th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS (7551), pp. 225-236 (2012)

  • Interval Scheduling on Related Machines: Complexity and Online Algorithms
    S. O. Krumke, C. Thielen, S. Westphal,
    Proceedings of the 10th Workshop on Models and Algorithms for Planning and Scheduling Problems (MAPSP), pp. 236-238 (2011)

  • MIP formulations for Flowshop Scheduling with Limited Buffers
    J. Frasch, S. O. Krumke, S. Westphal,
    Proceedings of the 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, LNCS (6595), pp. 127-138 (2011)

  • Strong Implementation of Social Choice Function in Dominant Strategies
    C. Thielen, S. O. Krumke,
    Proceedings of the 3rd International Workshop on Computational Social Choice (COMSOC), pp. 319-330 (2010)

  • Strong Implementation of Social Choice Functions in Dominant Strategies
    S. O. Krumke, C. Thielen,
    Proceedings of the 3rd International Workshop on Computational Social Choice, pp. 319-330 (2010)

  • The complexity of integrating timetabling and vehicle scheduling
    N. Hansen, S. O. Krumke,
    Proceedings of the 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (2009)

  • Integrating timetabling and vehicle scheduling
    N. Hansen, S. O. Krumke,
    Proceedings of the 23rd European Conference on Operational Research (2009)

  • Randomized online algorithms for the dynamic multi-period routing problem
    S. Saliba, S. O. Krumke, B. Hiller, A. Tuchscherer,
    Proceedings of the 9th Workshop on Models and Algorithms for Planning and Scheduling Problems (2009)

  • Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2
    B. Engels, S. O. Krumke, R. Schrader, C. Zeck,
    Proceedings of the 8th Cologne Twente Workshop on Graphs and Combinatorial Optimization, pp. 239-243 (2009)

  • Truthful Mechanisms for Selfish Routing and Two-Parameter Agents
    C. Thielen, S. O. Krumke,
    Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT), LNCS (5814), pp. 36-47 (2009)

  • Complexity of Strong Implementability
    C. Thielen, S. O. Krumke,
    Proceedings of the 4th Athens Colloquium on Algorithms and Complexity (ACAC), EPTCS (4), pp. 1-12 (2009)

  • A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints
    C. Thielen, S. O. Krumke,
    Proceedings of the 6th Workshop on Approximation and Online Algorithms (WAOA), LNCS (5426), pp. 105-118 (2008)

  • Improved Construction Heuristics and Local Search for the Routing and Wavelength Assignment Problem
    K. Bauer, T. Fischer, S O. Krumke, K. Gerhardt, S. Westphal, P. Merz,
    Proceedings of EvoCOP 2008 - Eight European Conference on Evolutionary Computation in Combinatorial Optimisation, LNCS (4972), pp. 158-169 (2008)

  • How hard is it to find extreme Nash equilibria in congestion games?
    E. Gassner, J. Hatzl, S O. Krumke, H. Sperber, G J. Woeginger,
    Proceedings of the 4th International Workshop on Internet and Network Economics, LNCS (5385), pp. 82-93 (2008)

  • Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs
    S O. Krumke, P. Merz, T. Nonner, K. Rupp,
    Principles of Distributed Systems, LNCS (4878), pp. 159-173 (2007)

  • Approximation of a Real-World Vehicle Dispatching Problem
    S O. Krumke, S. Saliba, T. Vredeveld, S. Westphal,
    International Conference on Operations Research, pp. 181 (2006)

  • Improved Pruning in Column Generation of a Vehicle Routing Problem
    S. Westphal, S O. Krumke,
    Proceedings of the 2nd Multidisciplinary International Conference on Scheduling: Theory and Applications, pp. 705-722 (2005)

  • Deterministic Online Optical Call Admission Revisited
    E. Gassner, S O. Krumke,
    Proceedings of the 3rd Workshop on Approximation and Online Algorithms, LNCS (3879), pp. 190-202 (2005)

  • The Online Target Date Assignment Problem
    S. Heinz, S O. Krumke, N. Megow, J. Rambau, A. Tuschscherer, T. Vredeveld,
    Proceedings of the 3rd Workshop on Approximation and Online Algorithms, LNCS (3879), pp. 230-243 (2005)

  • On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem
    S O. Krumke, W E. Paepe, D. Poensgen, M. Lipmann, A. Marchetti-Spaccamela, L. Stougie,
    Proceedings of the 3rd Workshop on Approximation and Online Algorithms, LNCS (3879), pp. 258-269 (2005)

  • Reoptimization gaps versus model errors in online-dispatching of service units
    B. Hiller, S O. Krumke, J. Rambau,
    Proceedings of the Latin-American Conference on Combinatorics, Graphs and Algorithms, Electronic Notes in Discrete Mathematics (18), pp. 157-163 (2004)

  • Experimental Study of Routing Algorithms in Optical Networks
    R. Hülsermann, M. Jäger, S O. Krumke, D. Poensgen, J. Rambau, A. Tuchscherer,
    Proceedings of the 7th IFIP Working Conference on Optical Network Design & Modelling (2003)

  • Scheduling a server on a caterpillar network - a probabilistic analysis
    A. Coja-Oghlan, S O. Krumke, T. Nierhoff,
    Proceedings of the 6th Workshop on Models and Algorithms for Planning and Scheduling Problems, pp. 48-50 (2003)

  • A heuristic for the Stacker Crane Problem on trees which is almost surely exact
    A. Coja-Oghlan, S O. Krumke, T. Nierhoff,
    Proceedings of the 14th International Symposium on Algorithms and Computation, LNCS (2906), pp. 605-614 (2003)

  • Topology Control Problems Under Symmetric and Asymmetric Power Thresholds
    S O. Krumke, R. Liu, E L. Lloyd, M V. Marathe, R. Ramanathan, S S. Ravi,
    Proceedings of the International Conference on Ad hoc and Wireless Networks, LNCS (2865), pp. 187-198 (2003)

  • How to whack moles
    S O. Krumke, N. Megow, T. Vredeveld,
    Proceedings of the 1st Workshop on Approximation and Online Algorithms, LNCS (2909), pp. 192-205 (2003)

  • Online-Dispatching of Automobile Service Units
    S O. Krumke, J. Rambau, L M. Torres,
    Proceedings of the International Conference of Operations Research (OR2002), pp. 168-173 (2002)

  • How to cut a cake almost fairly
    S O. Krumke, M. Lipmann, W. Paepe, D. Poensgen, J. Rambau, L. Stougie, G J. Woeginger,
    Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 263-264 (2002)

  • Online Call Admission in Optical Networks with Larger Wavelength Demands
    S O. Krumke, D. Poensgen,
    Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS (2573), pp. 333-344 (2002)

  • Budgeted Maximum Graph Coverage
    S O. Krumke, M V. Marathe, D. Poensgen, S S. Ravi, H -C. Wirth,
    Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS (2573), pp. 321-332 (2002)

  • Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows
    S O. Krumke, J. Rambau, L M. Torres,
    Proceedings of the 10th Annual European Symposium on Algorithms, LNCS (2461), pp. 637-648 (2002)

  • Non-Abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem
    S O. Krumke, L. Laura, M. Lipmann, A. Marchetti-Spaccamela, W E. Paepe, D. Poensgen, L. Stougie,
    Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization, LNCS (2462), pp. 200-214 (2002)

  • Online Bincoloring
    S O. Krumke, W E. Paepe, L. Stougie, J. Rambau,
    Proceedings of the 9th Annual European Symposium on Algorithms, LNCS (2161), pp. 74-84 (2001)

  • Multiple Hotlink Assignment
    S. Fuhrmann, S O. Krumke, H -C. Wirth,
    Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, LNCS (2204), pp. 189-200 (2001)

  • News from the Online Traveling Repairman
    S O. Krumke, W E. Paepe, D. Poensgen, L. Stougie,
    Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, LNCS (2136), pp. 487-499 (2001)

  • Online Dial-a-Ride Problems: Minimizing the Completion Time
    N. Ascheuer, S O. Krumke, J. Rambau,
    Proceedings of the 17th International Symposium on Theoretical Aspects of Computer Science, LNCS (1770), pp. 639-650 (2000)

  • The Online Dial-a-Ride Problem under Reasonable Load
    D. Hauptmeier, S O. Krumke, J. Rambau,
    Proceedings of the 4th Italian Conference on Algorithms and Complexity, LNCS (1767), pp. 125-136 (2000)

  • The Online-TSP Against Fair Adversaries
    M. Blom, S O. Krumke, W E. Paepe, L. Stougie,
    Proceedings of the 4th Italian Conference on Algorithms and Complexity, LNCS (1767), pp. 137-149 (2000)

  • Budget Constrained Minimum Cost Connected Medians
    G. Konjevod, S O. Krumke, M V. Marathe,
    Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science, Konstanz, Germay, LNCS (1928), pp. 267-278 (2000)

  • Euler is standing in line
    D. Hauptmeier, S O. Krumke, J. Rambau, H -C. Wirth,
    Proceedings of the 25th International Workshop on Graph-Theoretic Concept in Computer Science, Ascona, Switzerland, LNCS (1665), pp. 42-54 (1999)

  • Combinatorial Online Optimization
    N. Ascheuer, M. Grötschel, S O. Krumke, J. Rambau,
    Proceedings of the International Conference of Operations Research (OR'98), pp. 21-37 (1998)

  • Flow Improvement and Flows with Fixed Costs
    S O. Krumke, H. Noltemeier, R. Ravi, S. Schwarz, H -C. Wirth,
    Proceedings of the International Conference on Operations Research (OR'98), pp. 158-167 (1998)

  • Approximation Algorithms for Channel Assignment in Radio Networks
    S O. Krumke, M V. Marathe, S S. Ravi,
    Second International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, Dallas, Texas (1998)

  • Upgrading Bottleneck Constrained Forests
    S O. Krumke, M V. Marathe, H. Noltemeier, S S. Ravi, H -C. Wirth,
    Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science, Smolenice Castle, Slovak Republic, LNCS (1517), pp. 215-226 (1998)

  • Improving Spanning Trees by Upgrading Nodes
    S O. Krumke, M V. Marathe, H. Noltemeier, R. Ravi, S S. Ravi, R. Sundaram, H -C. Wirth,
    Proceedings of the 24th International Colloquium on Automata, Languages and Programming, LNCS (1256), pp. 281-291 (1997)

  • Bicriteria Compact Location Problems
    S O. Krumke, H. Noltemeier, S S. Ravi, M V. Marathe,
    Recent Advances in Locational Analysis, Studies in Locational Analysis (10), pp. 37-51 (1996)

  • Finding Placement Sequences and Bin Locations for Pick and Place Robots
    C. Mauckner, H. Noltemeier, S O. Krumke,
    Recent Advances in Locational Analysis, Studies in Locational Analysis (10), pp. 67-89 (1996)

  • Modifying Networks to Obtain Low Cost Trees
    S O. Krumke, H. Noltemeier, S S. Ravi, M V. Marathe, K U. Drangmeister,
    Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science , Cadenabbia, Italy, LNCS (1197), pp. 293-307 (1996)

  • On the Convergence of a Modified Barrier Function Method for Convex Quadratic and Linear Programming
    S O. Krumke,
    Proceedings of the Third International Conference on Industrial and Applied Mathematics, Hamburg, Germany (1995)

  • Compact Location Problems with Budget and Communication Constraints
    S O. Krumke, H. Noltemeier, S S. Ravi, M V. Marathe,
    Proceedings of the 1st International Conference on Computing and Combinatorics, (959), pp. 510-519 (1995)

  • Complexity and Approximability of some Bicriteria Location Problems
    S O. Krumke, H. Noltemeier, S S. Ravi, M V. Marathe,
    Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science , Aachen, Germany, LNCS (1017), pp. 73-87 (1995)

  • Compact Location Problems
    V. Radhakrishnan, S O. Krumke, M V. Marathe, D J. Rosenkrantz, S S. Ravi,
    Proceedings of the 13th Conference on Software Technology and Theoretical Computer Science, Bombay, India, LNCS (761), pp. 238-247 (1993)

Zum Seitenanfang