An almost four-approximation algorithm for maximum weight triangulation

Shiyan Hu ()
Additional contact information
Shiyan Hu: Michigan Technological University

Journal of Combinatorial Optimization, 2010, vol. 19, issue 1, No 3, 42 pages

Abstract: Abstract We consider the following planar maximum weight triangulation (MAT) problem: given a set of n points in the plane, find a triangulation such that the total length of edges in triangulation is maximized. We prove an $\Omega(\sqrt{n})$ lower bound on the approximation factor for several heuristics: maximum greedy triangulation, maximum greedy spanning tree triangulation and maximum spanning tree triangulation. We then propose the Spoke Triangulation algorithm, which approximates the maximum weight triangulation for points in general position within a factor of almost four in O(nlog n) time. The proof is simpler than the previous work. We also prove that Spoke Triangulation approximates the maximum weight triangulation of a convex polygon within a factor of two.

Keywords: Triangulation; Maximum weight triangulation; Spoke triangulation; Approximation algorithm; Approximation ratio (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-008-9158-9 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:19:y:2010:i:1:d:10.1007_s10878-008-9158-9

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-008-9158-9

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().