WorldCat Identities

Krumke, Sven O.

Overview
Works: 28 works in 37 publications in 2 languages and 64 library holdings
Roles: Other, Author
Publication Timeline
.
Most widely held works by Sven O Krumke
A Generalized Network Model for Freight Car Distribution by Birgit Engels( )

1 edition published in 2011 in English and held by 16 WorldCat member libraries worldwide

Online-Dispatching 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 real-world vehicle dispatching problem at ADAC, the German Automobile Association."
On minimizing the maximum flow time in the online dial-a-ride problem( Book )

2 editions published in 2005 in English and held by 4 WorldCat member libraries worldwide

Online optimization : competitive analysis and beyond by Sven O Krumke( )

2 editions published between 2002 and 2006 in English and held by 3 WorldCat member libraries worldwide

Bincoloring( Book )

2 editions published in 2007 in English and held by 3 WorldCat member libraries worldwide

Wo bleibt der Aufzug?( )

2 editions published in 1999 in German and held by 2 WorldCat member libraries worldwide

How to cut a cake almost fairly( )

2 editions published between 2002 and 2006 in English and held by 2 WorldCat member libraries worldwide

Non-abusiveness 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 2 WorldCat member libraries worldwide

Average case analysis of a hard dial-a-ride problem( )

1 edition published in 2003 in English and held by 2 WorldCat member libraries worldwide

In the dial-a-ride-problem (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 NP-hard 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 semi-random setting and in the unweighted case
Budgeted maximum graph coverage( )

2 editions published between 2002 and 2006 in English and held by 2 WorldCat member libraries 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

Online-dispatching of automobile service units( )

1 edition published in 2002 in English and held by 1 WorldCat member library worldwide

The online-TSP 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 non-negative part of the real line. We show that a very natural strategy is 3/2-competitive 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."
Optimization of optical networks with dynamic routing : Milestone 4( )

1 edition published in 2002 in English and held by 1 WorldCat member library worldwide

Online Resource Management by Morten Tiedemann( )

1 edition published in 2015 in English and held by 1 WorldCat member library worldwide

Average case analysis of a hard dial-a-ride problem by Amin Coja-Oghlan( Book )

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

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 'Dial-a-Ride' 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 NP-hard 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."
Stability with uniform bounds for online dial-a-ride problems under reasonable load by Sven O Krumke( )

1 edition published in 2011 in English and held by 0 WorldCat member libraries worldwide

 
moreShow More Titles
fewerShow Fewer Titles
Audience Level
0
Audience Level
1
  Kids General Special  
Audience level: 0.93 (from 0.88 for The online ... to 0.97 for Online Res ...)

Alternative Names
Krumke, S. O.

Krumke, S. O. (Sven O.)

Languages
English (25)

German (4)