57 search results - page 6 / 12 » Approximating Sparsest Cut in Graphs of Bounded Treewidth |
167
click to vote
ICCV
2005
IEEE
16 years 8 months ago
2005
IEEE
A new framework is presented that uses tools from duality theory of linear programming to derive graph-cut based combinatorial algorithms for approximating NP-hard classification ...
145
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
We consider the problem of Simultaneous Source Location – selecting locations for sources in a capacitated graph such that a given set of demands can be satisfied. We give an ex...
175
click to vote
FOCS
2009
IEEE
16 years 23 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...
195
click to vote
TCC
2012
Springer
14 years 1 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
160
click to vote
FOCS
2008
IEEE
16 years 14 days ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...