99 search results - page 1 / 20 » Approximation algorithms and hardness of integral concurrent... |
117
Voted
STOC
2012
ACM
13 years 23 days ago
2012
ACM
SIAMCOMP
1998
14 years 10 months ago
1998
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...
NETWORKS
2007
14 years 9 months ago
2007
This paper defines an incremental version of the maximum flow problem. In this model, the capacities increase over time and the resulting solution is a sequence of flows that b...
SIAMDM
2000
14 years 10 months ago
2000
Abstract. We describe fully polynomial time approximation schemes for various multicommodity flow problems in graphs with m edges and n vertices. We present the first approximation...
DIALM
2008
ACM
15 years 3 days ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...