296 search results - page 1 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
APPROX
2005
Springer
13 years 11 months ago
2005
Springer
FOCS
2009
IEEE
14 years 15 days ago
2009
IEEE
— Linial, London and Rabinovich [16] and Aumann and Rabani [3] proved that the min-cut max-flow ratio for general maximum concurrent flow problems (when there are k commodities...
ICCV
1999
IEEE
14 years 7 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
SODA
2012
ACM
11 years 8 months ago
2012
ACM
Given an undirected graph with edge lengths and a subset of nodes (called the terminals), the multiway cut (also called the multi-terminal cut) problem asks for a subset of edges,...
UAI
2004
13 years 7 months ago
2004
An autonomous variational inference algorithm for arbitrary graphical models requires the ability to optimize variational approximations over the space of model parameters as well...