160 search results - page 3 / 32 » Strongly Polynomial Algorithms for the Unsplittable Flow Pro... |
MOR
2000
13 years 7 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
WAOA
2005
Springer
14 years 1 months ago
2005
Springer
Given a graph with a source and a sink node, the NP–hard maximum k–splittable flow (MkSF) problem is to find a flow of maximum value with a flow decomposition using at most...
STOC
1999
ACM
14 years 1 days ago
1999
ACM
We propose the first combinatorial solution to one of the most classic problems in combinatorial optimization: the generalized minimum cost flow problem (flow with losses and g...
NETWORKS
2006
13 years 7 months ago
2006
We are given a directed network G = (V, A, u) with vertex set V , arc set A, a source vertex s V , a destination vertex t V , a finite capacity vector u = {uij}ijA, and a positi...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Strong and weak simulation relations have been proposed for Markov chains, while strong simulation and strong probabilistic simulation relations have been proposed for probabilisti...