160 search results - page 12 / 32 » Strongly Polynomial Algorithms for the Unsplittable Flow Pro... |
IPCO
2008
13 years 9 months ago
2008
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
TON
2008
13 years 7 months ago
2008
Given a set of demands between pairs of nodes, we examine the traffic engineering problem of flow routing and fair bandwidth allocation where flows can be split to multiple paths ...
JCO
2010
13 years 6 months ago
2010
Given a directed graph G = (N, A) with arc capacities uij and a minimum cost flow problem defined on G, the capacity inverse minimum cost flow problem is to find a new capacit...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
STOC
1993
ACM
13 years 12 months ago
1993
ACM
We study the Maximum Flow Network Interdiction Problem (MFNIP). We present two classes of polynomially separable valid inequalities for Cardinality MFNIP. We also prove the integr...