On a linear program for minimum-weight triangulation
نویسندگان
چکیده
Minimum-weight triangulation (MWT) is NP-hard. It has a polynomial-time constant-factor approximation algorithm, and a variety of effective polynomialtime heuristics that, for many instances, can find the exact MWT. Linear programs (LPs) for MWT are well-studied, but previously no connection was known between any LP and any approximation algorithm or heuristic for MWT. Here we show the first such connections: for an LP formulation due to Dantzig et al. (1985): (i) the integrality gap is bounded by a constant; (ii) given any instance, if the aforementioned heuristics find the MWT, then so does the LP.
منابع مشابه
A new asymmetric inclusion region for minimum weight triangulation
As a global optimization problem, planar minimum weight triangulation problem has attracted extensive research attention. In this paper, a new asymmetric graph called one-sided β-skeleton is introduced. We show that the one-sided circle-disconnected ( √ 2β)skeleton is a subgraph of a minimum weight triangulation. An algorithm for identifying subgraph of minimum weight triangulation using the on...
متن کاملMinimal Discrete Curves and Surfaces
In this thesis, we apply the ideas from combinatorial optimization to find globally optimal solutions arising in discrete and continuous minimization problems. Though we limit ourselves with the 1and 2-dimensional surfaces, our methods can be easily generalized to higher dimensions. We start with a continuous N -dimensional variational problem and show that under very general conditions it can ...
متن کاملDiamonds Are Not a Minimum Weight Triangulation's Best Friend
Two recent methods have increased hopes of finding a polynomial time solution to the problem of computing the minimum weight triangulation of a set S of n points in the plane . Both involve computing what was believed to be a connected or nearly connected subgraph of the minimum weight triangulation, and then completing the triangulation optimally. The first method uses the light graph of S as ...
متن کاملThe Minimum Weight Triangulation Problem with Few Inner Points
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, points in the interior of the convex hull). As a case study, we consider the minimum weight triangulation problem. Finding a minimum weight triangulation for a set of n points in the plane is not known to be NP-hard nor so...
متن کاملA Genetic Algorithm for the Minimum Weight Triangulation
triangulation of points on a plane, called Genetic Minimum Weight Triangulation (GMWT for short), is presented based on the rationale of genetic algorithms. Polygon crossover and its algorithm for triangulations are proposed. New adaptive genetic operators, or adaptive crossover and mutation operators, are introduced. It is shown that the new method for the minimum weight triangulation can obta...
متن کامل