Skutella Martin

Martin Skutella

Information about the author Martin Skutella will soon be added to the site.
Found 13 papers in total
Graph orientation and flows over time
Graph orientation and flows over time
2015
Flows over time are used to model many real‐world logistic and routing...
Continuous and discrete flows over time
Continuous and discrete flows over time
2011
Network flows over time form a fascinating area of research. They model the temporal...
A note on the generalized min‐sum set cover problem
A note on the generalized min‐sum set cover problem
2011
This paper considers the generalized min-sum set cover problem. A 485-approximation...
Computing Minimum Cuts by Randomized Search Heuristics
Computing Minimum Cuts by Randomized Search Heuristics
2011
We study the minimum s ‐ t ‐cut problem in graphs with costs on the...
Single-source k-splittable min-cost flows
Single-source k-splittable min-cost flows
2009
Motivated by a famous open question on the single-source unsplittable minimum cost...
Flows with unit path capacities and related packing and covering problems
Flows with unit path capacities and related packing and covering problems
2009
Since the seminal work of Ford and Fulkerson in the 1950s, network flow theory is one...
Online scheduling with bounded migration
Online scheduling with bounded migration
2009
Consider the classical online scheduling problem, in which jobs that arrive one by one...
Earliest arrival flows with multiple sources
Earliest arrival flows with multiple sources
2009
Earliest arrival flows capture the essence of evacuation planning. Given a network...
A fully polynomial time approximation scheme for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
A fully polynomial time approximation scheme for Quickest Multicommodity Flows with Inflow-Dependent Transit Times
2007
Given a network with capacities and transit times on the arcs, the quickest flow...
The Freeze-Tag Problem: How to wake up a swarm of robots
The Freeze-Tag Problem: How to wake up a swarm of robots
2006
An optimization problem that naturally arises in the study of swarm robotics is the...
The k-splittable flow problem
The k-splittable flow problem
2005
In traditional multi-commodity flow theory, the task is to send a certain amount of...
Approximating k-hop minimum-spanning trees
Approximating k-hop minimum-spanning trees
2005
Given a complete graph on ∼ n nodes with metric edge costs, the minimum-cost k...
The power of α-points in preemptive single machine scheduling
The power of α-points in preemptive single machine scheduling
2002
We consider the NP-hard preemptive single-machine scheduling problem to minimize the...
Papers per page: