133 search results - page 14 / 27 » Approximating the Minimum Weight Triangulation |
JGAA
2006
13 years 6 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...
IPL
1998
13 years 6 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
JGAA
2000
13 years 6 months ago
2000
This paper considers problems of the following type: given an edgeweighted k-colored input graph with maximum color class size c, find a minimum or maximum c-way cut such that eac...
APPROX
2009
Springer
14 years 1 months ago
2009
Springer
We explore the average-case “Vickrey” cost of structures in a random setting: the Vickrey cost of a shortest path in a complete graph or digraph with random edge weights; the V...
JCO
2008
13 years 6 months ago
2008
The problem of partitioning a partially ordered set into a minimum number of chains is a well-known problem. In this paper we study a generalization of this problem, where we not ...