Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation

@inproceedings{Levcopoulos1996QuasiGreedyTA,
  title={Quasi-Greedy Triangulations Approximating the Minimum Weight Triangulation},
  author={Christos Levcopoulos and Drago Krznaric},
  booktitle={SODA},
  year={1996}
}
This paper settles the following two longstanding open problems: 1. What is the worst-case approximation ratio between the greedy and the minimum weight triangulation? 2. Is there a polynomial time algorithm that always produces a triangulation whose length is within a constant factor from the minimum? The answer to the rst question is that the known ( p n) lower bound is tight. The second question is answered in the a rmative by using a slight modi cation of an O(n logn) algorithm for the… CONTINUE READING
Highly Influential
This paper has highly influenced 10 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

Citations

Publications citing this paper.
Showing 1-10 of 40 extracted citations

Similar Papers

Loading similar papers…