13 search results - page 1 / 3 » On a linear program for minimum-weight triangulation |
COMPGEOM
2006
ACM
13 years 10 months ago
2006
ACM
A triangulation of a planar point set S is a maximal plane straight-line graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangula...
IWPEC
2004
Springer
13 years 10 months ago
2004
Springer
We propose to look at the computational complexity of 2-dimensional geometric optimization problems on a finite point set with respect to the number of inner points (that is, poi...
IJCGA
2008
13 years 4 months ago
2008
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
DAGSTUHL
2006
13 years 6 months ago
2006
We consider the computational complexity of producing the best possible offspring in a crossover, given two solutions of the parents. The crossover operators are studied on the cla...
SODA
2012
ACM
11 years 7 months ago
2012
ACM
ABSTRACT∗ Arman Yousefi† Neal E. Young‡ Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of e...