296 search results - page 23 / 60 » Approximation Algorithms for Requirement Cut on Graphs |
GD
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A graph is planar if and only if it does not contain a Kuratowski subdivision. Hence such a subdivision can be used as a witness for non-planarity. Modern planarity testi...
131
click to vote
ESA
2011
Springer
13 years 11 months ago
2011
Springer
In this work we study the problem of Bipartite Correlation Clustering (BCC), a natural bipartite counterpart of the well studied Correlation Clustering (CC) problem. Given a bipart...
92
Voted
CVPR
2006
IEEE
16 years 1 months ago
2006
IEEE
ct We introduce a new family of spectral partitioning methods. Edge separators of a graph are produced by iteratively reweighting the edges until the graph disconnects into the pre...
112
click to vote
CVPR
2012
IEEE
13 years 2 months ago
2012
IEEE
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...
117
click to vote
STOC
2010
ACM
15 years 4 months ago
2010
ACM
The Steiner tree problem is one of the most fundamental ÆÈ-hard problems: given a weighted undirected graph and a subset of terminal nodes, find a minimum weight tree spanning ...