37 citations · 112 across the 26 of their papers we have counts for
Showing 2010Show all
3 papers · 1 filter
math.OC2010★ 2 cited
Replacing spectral techniques for expander ratio, normalized cut and conductance by combinatorial flow algorithms
Dorit S. Hochbaum
Several challenging problem in clustering, partitioning and imaging have traditionally been solved using the "spectral technique". These problems include the normalized cut problem…
cs.DM2010★ 6 cited
Submodular problems - approximations and algorithms
Dorit S. Hochbaum
We show that any submodular minimization (SM) problem defined on a linear constraint set with constraints having up to two variables per inequality, are 2-approximable in polynomia…
cs.CV2010
Competitive Analysis of Minimum-Cut Maximum Flow Algorithms in Vision Problems
Barak Fishbain, Dorit S. Hochbaum, Stefan Mueller
Rapid advances in image acquisition and storage technology underline the need for algorithms that are capable of solving large scale image processing and computer-vision problems.…