642 search results - page 89 / 129 » Approximation Algorithms for Minimum K-Cut |
APPROX
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We study the problem embedding an n-point metric space into another n-point metric space while minimizing distortion. We show that there is no polynomial time algorithm t...
IPPS
2005
IEEE
15 years 5 months ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
WAOA
2005
Springer
15 years 5 months ago
2005
Springer
Let T = (V, E) be an undirected tree, in which each edge is associated with a non-negative cost, and let {s1, t1}, . . . , {sk, tk} be a collection of k distinct pairs of vertices...
COMPGEOM
2009
ACM
15 years 6 months ago
2009
ACM
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
3DPVT
2004
IEEE
15 years 3 months ago
2004
IEEE
We examine the implications of shape on the process of finding dense correspondence and half-occlusions for a stereo pair of images. The desired property of the depth map is that ...