Sven Oliver Krumke

According to our database1, Sven Oliver Krumke authored at least 90 papers between 1993 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
Robust multicovers with budgeted uncertainty.
European Journal of Operational Research, 2019

2018
An FPTAS for the knapsack problem with parametric weights.
Oper. Res. Lett., 2018

A generalized approximation framework for fractional network flow and packing problems.
Math. Meth. of OR, 2018

2017
Maximum flows in generalized processing networks.
J. Comb. Optim., 2017

On the complexity and approximability of budget-constrained minimum cost flows.
Inf. Process. Lett., 2017

An FPTAS for the parametric knapsack problem.
Inf. Process. Lett., 2017

A network simplex method for the budget-constrained minimum cost flow problem.
European Journal of Operational Research, 2017

2016
Capacitated network design games with weighted players.
Networks, 2016

Budget-constrained minimum cost flows.
J. Comb. Optim., 2016

The Canadian Tour Operator Problem on paths: tight bounds and resource augmentation.
J. Comb. Optim., 2016

ConGen: An Application Specific DRAM Memory Controller Generator.
Proceedings of the Second International Symposium on Memory Systems, 2016

2015
Robust bottleneck routing games.
Networks, 2015

On the Online Min-Wait Relocation Problem.
Electronic Notes in Discrete Mathematics, 2015

Convex generalized flows.
Discrete Applied Mathematics, 2015

2014
Computation of equilibria and the price of anarchy in bottleneck congestion games.
CEJOR, 2014

Relocation in Carsharing Systems Using Flows in Time-Expanded Networks.
Proceedings of the Experimental Algorithms - 13th International Symposium, 2014

Being Negative Makes Life NP-hard (for Product Sellers).
Proceedings of the Fun with Algorithms - 7th International Conference, 2014

2013
Online delay management on a single train line: beyond competitive analysis.
Public Transport, 2013

The generalized assignment problem with minimum quantities.
European Journal of Operational Research, 2013

Models and Algorithms for Carsharing Systems and Related Problems.
Electronic Notes in Discrete Mathematics, 2013

Generalized max flow in series-parallel graphs.
Discrete Optimization, 2013

2012
Erratum to "Minimum cost flows with minimum quantities" [Information Processing Letters 111 (11) (2011) 533-537].
Inf. Process. Lett., 2012

Approximating Infeasible 2VPI-Systems.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

2011
Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization.
Math. Meth. of OR, 2011

Selfish bin coloring.
J. Comb. Optim., 2011

Minimum cost flows with minimum quantities.
Inf. Process. Lett., 2011

Interval scheduling on related machines.
Computers & OR, 2011

Online scheduling of weighted equal-length jobs with hard deadlines on parallel machines.
Computers & OR, 2011

MIP Formulations for Flowshop Scheduling with Limited Buffers.
Proceedings of the Theory and Practice of Algorithms in (Computer) Systems, 2011

2010
clever or smart: Strategies for the online target date assignment problem.
Discrete Applied Mathematics, 2010

2009
New lower bounds for online k-server routing problems.
Inf. Process. Lett., 2009

Complexity of Strong Implementability
Proceedings of the Proceedings Fourth Athens Colloquium on Algorithms and Complexity, 2009

Truthful Mechanisms for Selfish Routing and Two-Parameter Agents.
Proceedings of the Algorithmic Game Theory, Second International Symposium, 2009

Integer Flow with Multipliers: The Special Case of Multipliers 1 and 2.
Proceedings of the 8th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2009

2008
Bincoloring.
Theor. Comput. Sci., 2008

A monotone approximation algorithm for scheduling with precedence constraints.
Oper. Res. Lett., 2008

Approximation algorithms for a vehicle routing problem.
Math. Meth. of OR, 2008

Semi-preemptive routing on trees.
Discrete Applied Mathematics, 2008

Pruning in column generation for service vehicle dispatching.
Annals OR, 2008

How Hard Is It to Find Extreme Nash Equilibria in Network Congestion Games?
Proceedings of the Internet and Network Economics, 4th International Workshop, 2008

A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints.
Proceedings of the Approximation and Online Algorithms, 6th International Workshop, 2008

Improved Construction Heuristics and Iterated Local Search for the Routing and Wavelength Assignment Problem.
Proceedings of the Evolutionary Computation in Combinatorial Optimization, 2008

2007
Referee report on the book titled "Production planning by mixed integer programming".
Math. Meth. of OR, 2007

Distributed Approximation Algorithms for Finding 2-Edge-Connected Subgraphs.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006
Erratum to "News from the online traveling repairman" [TCS 295 (1-3) (2003) 279-294].
Theor. Comput. Sci., 2006

How to whack moles.
Theor. Comput. Sci., 2006

Competitive Algorithms for Cottage Rental.
Electronic Notes in Discrete Mathematics, 2006

Online-Optimization of Large-Scale Vehicle Dispatching Problems.
Electronic Notes in Discrete Mathematics, 2006

Reoptimization gaps versus model errors in online-dispatching of service units for ADAC.
Discrete Applied Mathematics, 2006

2005
A Hard Dial-a-Ride Problem that is Easy on Average.
J. Scheduling, 2005

On Minimizing the Maximum Flow Time in the Online Dial-a-Ride Problem.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

The Online Target Date Assignment Problem.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

Deterministic Online Optical Call Admission Revisited.
Proceedings of the Approximation and Online Algorithms, Third International Workshop, 2005

2004
Reoptimization Gaps versus Model Errors in Online-Dispatching of Service Units for ADAC.
Electronic Notes in Discrete Mathematics, 2004

2003
How to Whack Moles.
Proceedings of the Approximation and Online Algorithms, First International Workshop, 2003

A Heuristic for the Stacker Crane Problem on Trees Which Is Almost Surely Exact.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Topology Control Problems under Symmetric and Asymmetric Power Thresholds.
Proceedings of the Ad-Hoc, Mobile, and Wireless Networks, Second International Conference, 2003

2002
Online Call Admission in Optical Networks with Larger Demands.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

Budgeted Maximum Graph Coverage.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2002

How to cut a cake almost fairly.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

Online-Dispatching of Automobile Service Units.
Proceedings of the Operations Research Proceedings 2002, 2002

Real-Time Dispatching of Guided and Unguided Automobile Service Units with Soft Time Windows.
Proceedings of the Algorithms, 2002

Non-abusiveness Helps: An O(1)-Competitive Algorithm for Minimizing the Maximum Flow Time in the Online Traveling Salesman Problem.
Proceedings of the Approximation Algorithms for Combinatorial Optimization, 2002

2001
Models and Approximation Algorithms for Channel Assignment in Radio Networks.
Wireless Networks, 2001

Euler is standing in line dial-a-ride problems with precedence-constraints.
Discrete Applied Mathematics, 2001

Multiple Hotlink Assignment.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2001

News from the Online Traveling Repairman.
Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Online Bin Coloring.
Proceedings of the Algorithms, 2001

2000
Budget Constrained Minimum Cost Connected Medians.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Online Dial-a-Ride Problems: Minimizing the Completion Time.
Proceedings of the STACS 2000, 2000

The Online Dial-a-Ride Problem under Reasonable Load.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

The Online-TSP against Fair Adversaries.
Proceedings of the Algorithms and Complexity, 4th Italian Conference, 2000

1999
Improving Spanning Trees by Upgrading Nodes.
Theor. Comput. Sci., 1999

Improving Minimum Cost Spanning Trees by Upgrading Nodes.
J. Algorithms, 1999

Network Design and Improvement.
ACM Comput. Surv., 1999

Euler is Standing in Line.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1999

1998
Modifying Edges of a Network to Obtain Short Subgraphs.
Theor. Comput. Sci., 1998

Approximation Algorithms for Certain Network Improvement Problems.
J. Comb. Optim., 1998

On Budget-Constrained Flow Improvement.
Inf. Process. Lett., 1998

On the Minimum Label Spanning Tree Problem.
Inf. Process. Lett., 1998

Upgrading Bottleneck Constrained Forests.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

1997
On the approximability of location and network design problems.
PhD thesis, 1997

Compact Location Problems.
Theor. Comput. Sci., 1997

Improving Spanning Trees by Upgrading Nodes.
Proceedings of the Automata, Languages and Programming, 24th International Colloquium, 1997

Network improvement problems.
Proceedings of the Network Design: Connectivity and Facilities Location, 1997

1996
Modifying Networks to Obtain Low Cost Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1996

1995
On a Generalization of the p-Center Problem.
Inf. Process. Lett., 1995

Complexity and Approximability of Certain Bicriteria Location Problems.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1995

Compact Location Problems with Budget and Communication Constraints.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1993
Compact Location Problems.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1993


  Loading...