✦ LIBER ✦

Linear time algorithms for convex and monotone approximation

✍ Scribed by Vasant A. Ubhaya

Publisher: Elsevier Science
Year: 1983
Tongue: English
Weight: 833 KB
Volume: 9
Category: Article
ISSN: 0898-1221
DOI: 10.1016/0898-1221(83)90121-9

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximately convex functions and appro

Approximately convex functions and approximately monotonic operators

✍ Huynh Van Ngai; Jean-Paul Penot 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 280 KB

The Polya algorithm for convex approxima

The Polya algorithm for convex approximation

✍ David A. Legg; Douglas W. Townsend 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 582 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 maximum matc

A linear time algorithm for maximum matchings in convex, bipartite graphs

✍ G. Steiner; J.S. Yeomans 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 563 KB

Approximation algorithms for maximum lin

Approximation algorithms for maximum linear arrangement

✍ Refael Hassin; Shlomi Rubinstein 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 92 KB

Linear time algorithms for linear progra

Linear time algorithms for linear programming

✍ E.A. Galperin 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 557 KB