Sciweavers

6 search results - page 1 / 2
» An FPTAS for Flows over Time with Aggregate Arc Capacities
Sort
View
WAOA
2010
Springer
264views Algorithms» more  WAOA 2010»
13 years 3 months ago
An FPTAS for Flows over Time with Aggregate Arc Capacities
We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dep...
Daniel Dressler, Martin Skutella
CIAC
2010
Springer
246views Algorithms» more  CIAC 2010»
13 years 9 months ago
Capacitated Confluent Flows: Complexity and Algorithms
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
Daniel Dressler and Martin Strehler
IPL
2007
107views more  IPL 2007»
13 years 5 months ago
Flows in dynamic networks with aggregate arc capacities
Dynamic networks are characterized by transit times on edges. Dynamic flow problems consider transshipment problems in dynamic networks. We introduce a new version of dynamic fl...
Vardges Melkonian
FOCS
1997
IEEE
13 years 9 months ago
Beyond the Flow Decomposition Barrier
We introduce a new approach to the maximum flow problem. This approach is based on assigning arc lengths based on the residual flow value and the residual arc capacities. Our appro...
Andrew V. Goldberg, Satish Rao
INFOCOM
2003
IEEE
13 years 10 months ago
Flow Level Simulation of Large IP Networks
— The aim of this paper is to simulate the interaction of a large number of TCP controlled flows and UDP flows sharing many routers/links, from the knowledge of the network par...
François Baccelli, Dohy Hong