✦ LIBER ✦

Efficient approximation algorithms for clustering point-sets

✍ Scribed by Guang Xu; Jinhui Xu

Book ID: 108100981
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 279 KB
Volume: 43
Category: Article
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2007.12.002

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation Algorithms for Connected D

Approximation Algorithms for Connected Dominating Sets

✍ S. Guha; S. Khuller 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 140 KB

Approximation Algorithms for Connected D

Approximation Algorithms for Connected Dominating Sets

✍ S. Guha; S. Khuller 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 61 KB

Improved Approximation Algorithms for Bi

Improved Approximation Algorithms for Bipartite Correlation Clustering

✍ Ailon, Nir; Avigdor-Elgrabli, Noa; Liberty, Edo; van Zuylen, Anke 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 242 KB

Near-Linear Approximation Algorithms for

Near-Linear Approximation Algorithms for Geometric Hitting Sets

✍ Pankaj K. Agarwal; Esther Ezra; Micha Sharir 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 837 KB

Approximation Algorithms for Independent

Approximation Algorithms for Independent Sets in Map Graphs

✍ Zhi-Zhong Chen 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 172 KB

This paper presents polynomial-time approximation algorithms for the problem of computing a maximum independent set in a given map graph G with or without weights on its vertices. If G is given together with a map, then a ratio of 1 + δ can be achieved by a quadratic-time algorithm for any given con

Efficient approximation algorithms for t

Efficient approximation algorithms for the achromatic number

✍ Piotr Krysta; Krzysztof Loryś 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 357 KB