File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1007/s10878-008-9158-9
- Scopus: eid_2-s2.0-74249114236
- WOS: WOS:000273402400003
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: An almost four-approximation algorithm for maximum weight triangulation
Title | An almost four-approximation algorithm for maximum weight triangulation |
---|---|
Authors | |
Keywords | Approximation algorithm Approximation ratio Maximum weight triangulation Spoke triangulation Triangulation |
Issue Date | 2010 |
Citation | Journal of Combinatorial Optimization, 2010, v. 19, n. 1, p. 31-42 How to Cite? |
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 ω(√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(nlogn) 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. © 2008 Springer Science+Business Media, LLC. |
Persistent Identifier | http://hdl.handle.net/10722/336079 |
ISSN | 2023 Impact Factor: 0.9 2023 SCImago Journal Rankings: 0.370 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Hu, Shiyan | - |
dc.date.accessioned | 2024-01-15T08:23:15Z | - |
dc.date.available | 2024-01-15T08:23:15Z | - |
dc.date.issued | 2010 | - |
dc.identifier.citation | Journal of Combinatorial Optimization, 2010, v. 19, n. 1, p. 31-42 | - |
dc.identifier.issn | 1382-6905 | - |
dc.identifier.uri | http://hdl.handle.net/10722/336079 | - |
dc.description.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 ω(√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(nlogn) 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. © 2008 Springer Science+Business Media, LLC. | - |
dc.language | eng | - |
dc.relation.ispartof | Journal of Combinatorial Optimization | - |
dc.subject | Approximation algorithm | - |
dc.subject | Approximation ratio | - |
dc.subject | Maximum weight triangulation | - |
dc.subject | Spoke triangulation | - |
dc.subject | Triangulation | - |
dc.title | An almost four-approximation algorithm for maximum weight triangulation | - |
dc.type | Article | - |
dc.description.nature | link_to_subscribed_fulltext | - |
dc.identifier.doi | 10.1007/s10878-008-9158-9 | - |
dc.identifier.scopus | eid_2-s2.0-74249114236 | - |
dc.identifier.volume | 19 | - |
dc.identifier.issue | 1 | - |
dc.identifier.spage | 31 | - |
dc.identifier.epage | 42 | - |
dc.identifier.eissn | 1573-2886 | - |
dc.identifier.isi | WOS:000273402400003 | - |