Krumke, Sven O.
Overview
Works:  24 works in 31 publications in 2 languages and 103 library holdings 

Roles:  Author 
Classifications:  T385, 004 
Publication Timeline
.
Most widely held works by
Sven O Krumke
OnlineDispatching of automobile service units by
Sven O Krumke(
Book
)
3 editions published in 2002 in English and held by 11 WorldCat member libraries worldwide
Abstract: "We present an online algorithm for a realworld vehicle dispatching problem at ADAC, the German Automobile Association."
3 editions published in 2002 in English and held by 11 WorldCat member libraries worldwide
Abstract: "We present an online algorithm for a realworld vehicle dispatching problem at ADAC, the German Automobile Association."
Online bincoloring by
Sven O Krumke(
Book
)
3 editions published in 2001 in English and held by 10 WorldCat member libraries worldwide
Abstract: "We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored items into bins, such that the maximum number of different colors per bin is minimized. Each bin has size B [element of] N. The packing process is subject to the constraint that at any moment in time at most q [element of] N bins are partially filled. Moreover, bins may only be closed if they are filled completely. An online algorithm must pack each item must be packed [sic] without knowledge of any future items. We investigate the existence of competitive online algorithms for the bin coloring problem. We prove an upper bound of 3q  1 and a lower bound of 2q for the competitive ratio of a natural greedytype algorithm, and show that surprisingly a trivial algorithm which uses only one open bin has a strictly better competitive ratio of 2q  1. Moreover, we show that any deterministic algorithm has a competitive ratio [omega](q) and that randomization does not improve this lower bound even when the adversary is oblivious."
3 editions published in 2001 in English and held by 10 WorldCat member libraries worldwide
Abstract: "We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored items into bins, such that the maximum number of different colors per bin is minimized. Each bin has size B [element of] N. The packing process is subject to the constraint that at any moment in time at most q [element of] N bins are partially filled. Moreover, bins may only be closed if they are filled completely. An online algorithm must pack each item must be packed [sic] without knowledge of any future items. We investigate the existence of competitive online algorithms for the bin coloring problem. We prove an upper bound of 3q  1 and a lower bound of 2q for the competitive ratio of a natural greedytype algorithm, and show that surprisingly a trivial algorithm which uses only one open bin has a strictly better competitive ratio of 2q  1. Moreover, we show that any deterministic algorithm has a competitive ratio [omega](q) and that randomization does not improve this lower bound even when the adversary is oblivious."
Nonabusiveness helps : an 0(1)competitive algorithm for minimizing the maximum flow time in the online traveling salesman
problem(
)
2 editions published between 2002 and 2006 in English and held by 7 WorldCat member libraries worldwide
2 editions published between 2002 and 2006 in English and held by 7 WorldCat member libraries worldwide
Average case analysis of a hard dialaride problem(
)
1 edition published in 2003 in English and held by 7 WorldCat member libraries worldwide
In the dialarideproblem (DARP) objects have to be moved between given sources and destinations in a transportation network by means of a server. The goal is to find a shortest transportation for the server. We study the DARP when the underlying transportation network forms a caterpillar. This special case is strongly NPhard in the worst case. We prove that in a probabilistic setting there exists a polynomial time algorithm which almost surely finds an optimal solution. Moreover, with high probability the optimality of the solution found can be certified efficiently. We also examine the complexity of the DARP in a semirandom setting and in the unweighted case
1 edition published in 2003 in English and held by 7 WorldCat member libraries worldwide
In the dialarideproblem (DARP) objects have to be moved between given sources and destinations in a transportation network by means of a server. The goal is to find a shortest transportation for the server. We study the DARP when the underlying transportation network forms a caterpillar. This special case is strongly NPhard in the worst case. We prove that in a probabilistic setting there exists a polynomial time algorithm which almost surely finds an optimal solution. Moreover, with high probability the optimality of the solution found can be certified efficiently. We also examine the complexity of the DARP in a semirandom setting and in the unweighted case
How to cut a cake almost fairly(
)
2 editions published between 2002 and 2006 in English and held by 7 WorldCat member libraries worldwide
2 editions published between 2002 and 2006 in English and held by 7 WorldCat member libraries worldwide
Budgeted maximum graph coverage(
)
2 editions published between 2002 and 2006 in English and held by 7 WorldCat member libraries worldwide
2 editions published between 2002 and 2006 in English and held by 7 WorldCat member libraries worldwide
Online call admission in optical networks with larger wavelength demands(
)
1 edition published in 2002 in English and held by 6 WorldCat member libraries worldwide
1 edition published in 2002 in English and held by 6 WorldCat member libraries worldwide
Onlinedispatching of automobile service units(
)
1 edition published in 2002 in English and held by 6 WorldCat member libraries worldwide
1 edition published in 2002 in English and held by 6 WorldCat member libraries worldwide
Probieren geht über Studieren? : Entscheidungshilfen für kombinatorische OnlineOptimierungsprobleme in der innerbetrieblichen
Logistik(
)
1 edition published in 2002 in German and held by 6 WorldCat member libraries worldwide
1 edition published in 2002 in German and held by 6 WorldCat member libraries worldwide
Wo bleibt der Aufzug?(
)
1 edition published in 1999 in German and held by 2 WorldCat member libraries worldwide
1 edition published in 1999 in German and held by 2 WorldCat member libraries worldwide
Average case analysis of a hard dialaride problem by
Amin CojaOghlan(
Book
)
1 edition published in 2003 in English and held by 1 WorldCat member library worldwide
1 edition published in 2003 in English and held by 1 WorldCat member library worldwide
Online call admission in optical networks with larger wavelength demands by
Sven O Krumke(
Book
)
1 edition published in 2006 in English and held by 1 WorldCat member library worldwide
1 edition published in 2006 in English and held by 1 WorldCat member library worldwide
The onlineTSP against fair adversaries by
Michiel Blom(
Book
)
1 edition published in 2000 in English and held by 1 WorldCat member library worldwide
Abstract: "In the online traveling salesman problem requests for visits to cities (points in a metric space) arrive online while the salesman is traveling. The salesman moves at no more than unit speed and starts and ends his work at a designated origin. The objective is to find a routing for the salesman which finishes as early as possible. Performance of algorithms is measured through their competitive ratio, comparing the outcome of the algorithms with that of an adversary who provides the problem instance and therefore is able to achieve the optimal offline solution. Objections against such omnipotent adversaries have lead [sic] us to devise an adversary that is in a natural way, in the context of routing problems, more restricted in power. For the exposition we consider the online traveling salesman problem on the metric space given by R[+ over subscript 0], the nonnegative part of the real line. We show that a very natural strategy is 3/2competitive against the conventional adversary, which matches the lower bound on competitive ratios achievable for algorithms for this problem. Against the more 'fair adversary', that we propose, we show that there exists an algorithm with competitive ratio 1+[square root of 17]/4 [approximately =] 1.28 and provide a matching lower bound. We also show competitiveness results for a special class of algorithms (called zealous algorithms) that do not allow waiting time for the server as long as there are requests unserved."
1 edition published in 2000 in English and held by 1 WorldCat member library worldwide
Abstract: "In the online traveling salesman problem requests for visits to cities (points in a metric space) arrive online while the salesman is traveling. The salesman moves at no more than unit speed and starts and ends his work at a designated origin. The objective is to find a routing for the salesman which finishes as early as possible. Performance of algorithms is measured through their competitive ratio, comparing the outcome of the algorithms with that of an adversary who provides the problem instance and therefore is able to achieve the optimal offline solution. Objections against such omnipotent adversaries have lead [sic] us to devise an adversary that is in a natural way, in the context of routing problems, more restricted in power. For the exposition we consider the online traveling salesman problem on the metric space given by R[+ over subscript 0], the nonnegative part of the real line. We show that a very natural strategy is 3/2competitive against the conventional adversary, which matches the lower bound on competitive ratios achievable for algorithms for this problem. Against the more 'fair adversary', that we propose, we show that there exists an algorithm with competitive ratio 1+[square root of 17]/4 [approximately =] 1.28 and provide a matching lower bound. We also show competitiveness results for a special class of algorithms (called zealous algorithms) that do not allow waiting time for the server as long as there are requests unserved."
Euler is standing in line : dial a ride problems with FIFO precedence constraints by Dietrich Hauptmeier(
Book
)
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
Abstract: "In this paper we study algorithms for 'DialaRide' transportation problems. In the basic version of the problem we are given transportation jobs between the vertices of a graph and the goal is to find a shortest transportation that serves all the jobs. This problem is known to be NPhard even on trees. We consider the extension when precedence relations between the jobs with the same source are given. Our results include a polynomial time algorithm on paths and an approximation algorithm on general graphs with a performance of 9/4. For trees we improve the performance to 5/3."
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
Abstract: "In this paper we study algorithms for 'DialaRide' transportation problems. In the basic version of the problem we are given transportation jobs between the vertices of a graph and the goal is to find a shortest transportation that serves all the jobs. This problem is known to be NPhard even on trees. We consider the extension when precedence relations between the jobs with the same source are given. Our results include a polynomial time algorithm on paths and an approximation algorithm on general graphs with a performance of 9/4. For trees we improve the performance to 5/3."
Probieren geht über Studieren? : Entscheidungshilfen für kombinatorische OnlineOptimierungsprobleme in der innerbetrieblichen
Logistik by
Sven O Krumke(
Book
)
1 edition published in 2006 in German and held by 1 WorldCat member library worldwide
1 edition published in 2006 in German and held by 1 WorldCat member library worldwide
Online Optimierung : [Vorlesung im Wintersemester 1999/2000] by
Sven O Krumke(
Book
)
1 edition published in 2006 in German and held by 1 WorldCat member library worldwide
1 edition published in 2006 in German and held by 1 WorldCat member library worldwide
Flow improvement and network flows with fixed costs(
)
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
1 edition published in 1999 in English and held by 1 WorldCat member library worldwide
Optimization of optical networks with dynamic routing : Milestone 4(
)
1 edition published in 2002 in English and held by 1 WorldCat member library worldwide
1 edition published in 2002 in English and held by 1 WorldCat member library worldwide
Online dispatching of automobile service units in realtime by
Martin Grötschel(
Book
)
1 edition published in 2002 in English and held by 1 WorldCat member library worldwide
Abstract: "Combinatorial online optimization is an area with lots of applications and potential for significant progress, both in theory and in practice. In this short note we sketch the ADAC problem, a typical largescale online optimization problem, discuss some theoretical and practical issues coming up, and explain, very briefly, how we approach this problem mathematically. Online problems are a battlefield of heuristics with many strong claims about their solution quality. We indicate that a stronger problem orientation and the use of a little more mathematics may yield."
1 edition published in 2002 in English and held by 1 WorldCat member library worldwide
Abstract: "Combinatorial online optimization is an area with lots of applications and potential for significant progress, both in theory and in practice. In this short note we sketch the ADAC problem, a typical largescale online optimization problem, discuss some theoretical and practical issues coming up, and explain, very briefly, how we approach this problem mathematically. Online problems are a battlefield of heuristics with many strong claims about their solution quality. We indicate that a stronger problem orientation and the use of a little more mathematics may yield."
Graphentheoretische Konzepte und Algorithmen by
Sven Oliver Krumke(
)
1 edition published in 2009 in German and held by 0 WorldCat member libraries worldwide
Das Buch enth lt eine Einf hrung in graphentheoretische Grundbegriffe und Basiss tze. Graphen werden als Modellierungswerkzeuge f r verschiedene Anwendungen aus dem Bereich der Standortplanung, Logistik, Verkehrsplanung, des Scheduling und der Planung von Kommunikationsnetzen vorgestellt. F r die entstehenden graphentheoretischen Probleme werden effiziente Verfahren vorgestellt und rigoros analysiert. F r komplexit tstheoretisch ""schwierige"" Probleme enth lt das Buch effiziente N herungsverfahren, die schnell L sungen mit beweisbarer G te liefern
1 edition published in 2009 in German and held by 0 WorldCat member libraries worldwide
Das Buch enth lt eine Einf hrung in graphentheoretische Grundbegriffe und Basiss tze. Graphen werden als Modellierungswerkzeuge f r verschiedene Anwendungen aus dem Bereich der Standortplanung, Logistik, Verkehrsplanung, des Scheduling und der Planung von Kommunikationsnetzen vorgestellt. F r die entstehenden graphentheoretischen Probleme werden effiziente Verfahren vorgestellt und rigoros analysiert. F r komplexit tstheoretisch ""schwierige"" Probleme enth lt das Buch effiziente N herungsverfahren, die schnell L sungen mit beweisbarer G te liefern
more
fewer
Audience Level
0 

1  
Kids  General  Special 
Related Identities
Associated Subjects
Approximation algorithms Combinatorial optimization Computer algorithms Computer graphics Computer science Eulerian graph theory Graph theory Online algorithms Production scheduling Realtime data processing Transportation, AutomotiveDispatching Transportation problems (Programming) Traveling salesman problem