direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments



Preprint 011-2009
Tobias Harks and Max Klimm and Rolf H. Möhring.
Characterizing the Existence of Potential Functions in Weighted Congestion Games.

Preprint 014-2009
Ronald Koch and Martin Skutella.
Nash Equilibria and the Price of Anarchy for Flows Over Time.

Preprint 017-2009
Tobias Harks and Max Klimm and Rolf H. Möhring.
Strong Nash Equilibria in Games with the Lexicographical Improvement Property.


Preprint 032-2008
Tobias Harks and Konstantin Miller.
Efficiency and Stability of Nash Equilibria in Resource Allocation Games.

Preprint 034-2008
Christina Puhl.
Recoverable Robust Shortest Path Problems.

Preprint 030-2008
Martin Skutella and Alexia Weber.
On the dominant of the $s$-$t$-cut polytope.

Preprint 027-2008
Christian Liebchen and Elmar Swarat.
The Second Chvatal Closure Can Yield Better Railway Timetables.

Preprint 024-2008
Joachim Reichel and Martin Skutella.
Evolutionary Algorithms and Matroid Optimization Problems.

Preprint 035-2008
Nadine Baumann and Martin Skutella.
Solving Evacuation Problems Efficiently: Earliest Arrival Flows with Multiple Sources.

Preprint 017-2008
Vincenzo Bonifaci and Alberto Marchetti-Spaccamela and Sebastian Stiller.
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling.

Preprint 036-2008
Tobias Harks and Guido Schäfer and Martin Sieg.
Computing Optimal Network Tolls.

Preprint 021-2008
Maren Martens and Martin Skutella.
Flows with Unit Path Capacities and Related Packing and Covering Problems.

Preprint 023-2008
Frank Neumann and Joachim Reichel.
Approximating Minimum Multicuts by Evolutionary Multi-Objective Algorithms.

Preprint 003-2008
Frank Neumann and Joachim Reichel and Martin Skutella.
Computing Minimum Cuts by Randomized Search Heuristics.

Preprint 031-2008
Joachim Reichel and Martin Skutella.
On the Size of Weights in Randomized Search Heuristics.

Preprint 020-2008
Peter Sanders and Naveen Sivadasan and Martin Skutella.
Online Scheduling with Bounded Migration.

Preprint 022-2008
Martin Skutella.
An Introduction to Network Flows Over Time.


Preprint 045-2007
Gerald Lach and Marco E. Lübbecke.
Optimal University Course Timetables and the Partial Transversal Polytope.

Preprint 042-2007
Janina Brenner and Guido Schäfer.
Singleton Acyclic Mechanisms and their Applications to Scheduling Problems.

Preprint 039-2007
Ewgenij Gawrilow and Ekkehard Köhler and Rolf H. Möhring and Björn Stenzel.
Dynamic Routing of Automated Guided Vehicles in Real-time.

Preprint 029-2007
Nicole Megow and Tjark Vredeveld.
Stochastic Online Scheduling with Precedence Constraints.

Preprint 028-2007
Christina Puhl and Sebastian Stiller.
The Maximum Capacity of a Line Plan is Inapproximable.

Preprint 026-2007
Friedrich Eisenbrand and Fabrizio Grandoni and Thomas Rothvo\.
Approximating Connected Facility Location Problems via Random Facility Sampling and Core Detouring.

Preprint 020-2007
Vincenzo Bonifaci and Tobias Harks and Guido Schäfer.
The Impact of Stackelberg Routing in General Networks.

Preprint 022-2007
Michael Elkin and Christian Liebchen and Romeo Rizzi.
New Length Bounds for Cycle Bases.

Preprint 019-2007
Nadine Baumann and Sebastian Stiller.
The Price of Anarchy of a Network Creation Game with Exponential Payoff.

Preprint 017-2007
Christian Liebchen and Michael Schachtebeck and Anita Schöbel and Sebastian Stiller and André Prigge.
Computing Delay Resistant Railway Timetables.

Preprint 036-2007
König, Felix G. and Lübbecke, Marco E..
Sorting with Complete Networks of Stacks.

Preprint 004-2007
König, Felix G. and Lübbecke, Marco E. and Möhring, Rolf H. and Schäfer, Guido and Spenke, Ines.
Solutions to Real-World Instances of PSPACE-Complete Stacking.

Preprint 003-2007
Christian Liebchen and Gregor Wünsch and Ekkehard Köhler and Alexander Reich and Romeo Rizzi.
Benchmarks for Strictly Fundamental Cycle Bases.

Preprint 046-2007
Paul Bonsma and Frederic Dorn.
An FPT Algorithm for Directed Spanning k-Leaf.


Preprint 028-2006
Alberto Ceselli and Michael Gatto and Marco E. Lübbecke and Marc Nunkesser and Heiko Schilling.
Optimizing the Cargo Express Service of Swiss Federal Railways.

Preprint 030-2006
Gary Froyland and Thorsten Koch and Nicole Megow and Emily Duane and Howard Wren.
Optimizing the Landside Operation of a Container Terminal.

Preprint 032-2006
Romeo Rizzi and Christian Liebchen.
A New Bound on the Length of Minimum Cycle Bases.

Preprint 024-2006
Christian Liebchen and Sebastian Stiller.
Delay Resistant Timetabling.

Preprint 013-2006
Christian Liebchen and Gregor Wünsch.
The Zoo of Tree Spanner Problems.

Preprint 014-2006
Michael Balmer and Torben Edelhoff and Rolf H. Möhring and Heiko Schilling.
Optimal Route Assignment in Large Scale Micro-Simulations.

Preprint 007-2006
Ekkehard Köhler and Christian Liebchen and Romeo Rizzi and Gregor Wünsch.
Reducing the Optimality Gap of Strictly Fundamental Cycle Bases in Planar Grids.

Preprint 008-2006
Nicole Megow and Tjark Vredeveld.
Approximation Results for Preemptive Stochastic Online Scheduling.

Preprint 005-2006
Georg Baier and Thomas Erlebach and Alexander Hall and Ekkehard Köhler and Heiko Schilling and Martin Skutella.
Length-Bounded Cuts and Flows.


Preprint 018-2005
Christian Liebchen and Romeo Rizzi.
Classes of Cycle Bases.

Preprint 011-2005
Rolf H. Möhring and Heiko Schilling and Birk Schütz and Dorothea Wagner and Thomas Willhalm.
Partitioning Graphs to Speed Up Dijkstra's Algorithm.

Preprint 028-2005
Stefan Heinz and Sven O. Krumke and Nicole Megow and Jörg Rambau and Andreas Tuchscherer and Tjark Vredeveld.
The Online Target Date Assignment Problem.

Preprint 030-2005
Ronald Koch and Martin Skutella and Ines Spenke.
Maximum k-Splittable Flows.

Preprint 029-2005
Ronald Koch and Ines Spenke.
Complexity and Approximability of k-Splittable Flows.