✦ LIBER ✦

Approximating Minimum Manhattan Networks in Higher Dimensions

✍ Scribed by Das, Aparna; Gansner, Emden R.; Kaufmann, Michael; Kobourov, Stephen; Spoerhase, Joachim; Wolff, Alexander

Book ID: 120910086
Publisher: Springer
Year: 2013
Tongue: English
Weight: 689 KB
Volume: 71
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-013-9778-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A rounding algorithm for approximating m

A rounding algorithm for approximating minimum Manhattan networks

✍ Victor Chepoi; Karim Nouioua; Yann Vaxès 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 821 KB

Approximating Minimum-Weight Triangulati

Approximating Minimum-Weight Triangulations in Three Dimensions

✍ B. Aronov; S. Fortune 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 325 KB

Efficiently Approximating Polygonal Path

Efficiently Approximating Polygonal Paths in Three and Higher Dimensions

✍ G. Barequet, D. Z. Chen, O. Daescu, M. T. Goodrich and J. Snoeyink 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 148 KB

Minimum Manhattan Network Problem in Nor

Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm

✍ N. Catusse; V. Chepoi; K. Nouioua; Y. Vaxès 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 642 KB

Approximating the Minimum Number of Maxi

Approximating the Minimum Number of Maximum Power Users in Ad hoc Networks

✍ Errol L. Lloyd; Rui Liu; S. S. Ravi 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 967 KB

Efficiently Approximating the Minimum-Vo

Efficiently Approximating the Minimum-Volume Bounding Box of a Point Set in Three Dimensions

✍ Gill Barequet; Sariel Har-Peled 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 221 KB

We present an efficient O n + 1/ε 4 5 -time algorithm for computing a 1 + ε)approximation of the minimum-volume bounding box of n points in 3 . We also present a simpler algorithm whose running time is O n log n + n/ε 3 . We give some experimental results with implementations of various variants of