296 search results - page 3 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
120
click to vote
CVPR
2011
IEEE
14 years 5 months ago
2011
IEEE
We propose a new family of non-submodular global energy functions that still use submodularity internally to couple edges in a graph cut. We show it is possible to develop an ef...
ASIAN
1999
Springer
15 years 1 months ago
1999
Springer
CORR
2010
Springer
14 years 7 months ago
2010
Springer
We present a general method of designing fast approximation algorithms for cut-based minimization problems in undirected graphs. In particular, we develop a technique that given a...
CVPR
2006
IEEE
15 years 3 months ago
2006
IEEE
This paper adds a number of novel concepts into global s/t cut methods improving their efficiency and making them relevant for a wider class of applications in vision where algor...
APPROX
2010
Springer
14 years 9 months ago
2010
Springer
We give the first constant-factor approximation algorithm for Sparsest-Cut with general demands in bounded treewidth graphs. In contrast to previous algorithms, which rely on the f...