642 search results - page 14 / 129 » Approximation Algorithms for Minimum K-Cut |
JGAA
2006
14 years 11 months ago
2006
Two-dimensional phase unwrapping is the problem of deducing unambiguous "phase" from values known only modulo 2. Many authors agree that the objective of phase unwrappin...
104
click to vote
TCS
2008
14 years 11 months ago
2008
The medial axis is a classical representation of digital objects widely used in many applications. However, such a set of balls may not be optimal: subsets of the medial axis may ...
103
click to vote
IPL
2007
14 years 11 months ago
2007
Given a metric graph G, we are concerned with finding a spanning tree of G where the maximum weighted degree of its vertices is minimum. In a metric graph (or its spanning tree),...
APPROX
2008
Springer
15 years 1 months ago
2008
Springer
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We prove the existence of small core-sets for solving approximate k-center clustering and related problems. The size of these core-sets is considerably smaller than the previously...