186 search results - page 6 / 38 » The Partial Augment-Relabel Algorithm for the Maximum Flow P... |
FSTTCS
2009
Springer
14 years 1 months ago
2009
Springer
Partial Cover problems are optimization versions of fundamental and well studied problems like Vertex Cover and Dominating Set. Here one is interested in covering (or dominating) ...
FOCS
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper considers the problem of designing fast, approximate, combinatorial algorithms for multicommodity flows and other fractional packing problems. We provide a different ap...
SIGMETRICS
2009
ACM
14 years 1 months ago
2009
ACM
In the context of network traffic analysis, we address the problem of estimating the tail index of flow (or more generally of any group) size distribution from the observation of...
ICCV
1998
IEEE
13 years 11 months ago
1998
IEEE
This paper describes a new algorithm for solving the N-camera stereo correspondence problem by transforming it into a maximum- ow problem. Once solved, the minimum-cut associated ...
TAMC
2009
Springer
14 years 1 months ago
2009
Springer
In classical network flow theory the choice of paths, on which flow is sent, is only restricted by arc capacities. This, however, is not realistic in most applications. Many prob...