Sciweavers

19 search results - page 2 / 4
» Multicommodity Demand Flow in a Tree
Sort
View
JACM
2007
121views more  JACM 2007»
13 years 4 months ago
(Almost) Tight bounds and existence theorems for single-commodity confluent flows
A flow of a commodity is said to be confluent if at any node all the flow of the commodity leaves along a single edge. In this paper we study single-commodity confluent flow pro...
Jiangzhuo Chen, Robert D. Kleinberg, Lászl&...
STOC
2001
ACM
122views Algorithms» more  STOC 2001»
14 years 5 months ago
Provisioning a virtual private network: a network design problem for multicommodity flow
Consider a setting in which a group of nodes, situated in a large underlying network, wishes to reserve bandwidth on which to support communication. Virtual private networks (VPNs...
Anupam Gupta, Jon M. Kleinberg, Amit Kumar, Rajeev...
TRANSCI
2008
108views more  TRANSCI 2008»
13 years 4 months ago
Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search
The availability of relatively cheap small jet aircrafts suggests a new air transportation business: dial-a-flight, an on-demand service in which travelers call a few days in adva...
Daniel G. Espinoza, R. Garcia, Marcos Goycoolea, G...
APPROX
2006
Springer
120views Algorithms» more  APPROX 2006»
13 years 8 months ago
Single-Source Stochastic Routing
Abstract. We introduce and study the following model for routing uncertain demands through a network. We are given a capacitated multicommodity flow network with a single source an...
Shuchi Chawla, Tim Roughgarden
SIAMCOMP
1998
176views more  SIAMCOMP 1998»
13 years 4 months ago
An O(log k) Approximate Min-Cut Max-Flow Theorem and Approximation Algorithm
It is shown that the minimum cut ratio is within a factor of O(log k) of the maximum concurrent flow for k-commodity flow instances with arbitrary capacities and demands. This im...
Yonatan Aumann, Yuval Rabani