✦ LIBER ✦

A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons

✍ Scribed by Jianbo Qian; Cao An Wang

Publisher: Springer
Year: 2004
Tongue: English
Weight: 249 KB
Volume: 40
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-004-1101-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Linear-Time Approximation Scheme for M

A Linear-Time Approximation Scheme for Minimum Weight Triangulation of Convex Polygons

✍ C. Levcopoulos; D. Krznaric 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 320 KB

A linear-time near-optimum-length triang

A linear-time near-optimum-length triangulation algorithm for convex polygons

✍ Vitit Kantabutra 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 400 KB

This paper shows how to compute a short triangulation for a convex polygon in O(n) time, where n is the number of sides of the input polygon. The resulting triangulation is guaranteed to be of a total length that is only a constant factor of the shortest possible.

A linear-time algorithm for computing th

A linear-time algorithm for computing the voronoi diagram of a convex polygon

✍ Alok Aggarwal; Leonidas J. Guibas; James Saxe; Peter W. Shor 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 906 KB

Polynomial-time approximation scheme for

Polynomial-time approximation scheme for concurrent open shop scheduling with a fixed number of machines to minimize the total weighted completion time

✍ T.C. Edwin Cheng; Qingqin Nong; Chi To Ng 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 1 views