✦ LIBER ✦

On approximating metric 1-median in sublinear time

✍ Scribed by Wu, Bang Ye

Book ID: 121840052
Publisher: Elsevier Science
Year: 2014
Tongue: English
Weight: 179 KB
Volume: 114
Category: Article
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2013.12.004

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Deterministic sublinear-time approximati

Deterministic sublinear-time approximations for metric 1-median selection

✍ Chang, Ching-Lueh 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 173 KB

Some results on approximate 1-median sel

Some results on approximate 1-median selection in metric spaces

✍ Ching-Lueh Chang 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 291 KB

Approximating the Minimum Spanning Tree

Approximating the Minimum Spanning Tree Weight in Sublinear Time

✍ Chazelle, Bernard; Rubinfeld, Ronitt; Trevisan, Luca 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 168 KB

Approximating the Metric TSP in Linear T

Approximating the Metric TSP in Linear Time

✍ Davide Bilò; Luca Forlizzi; Guido Proietti 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 693 KB

An Efficient Approximate Algorithm for t

An Efficient Approximate Algorithm for the 1-Median Problem in Metric Spaces

✍ Cantone, D.; Cincotti, G.; Ferro, A.; Pulvirenti, A. 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 273 KB

Approximating the Weight of the Euclidea

Approximating the Weight of the Euclidean Minimum Spanning Tree in Sublinear Time

✍ Czumaj, Artur; Ergün, Funda; Fortnow, Lance; Magen, Avner; Newman, Ilan; Rubinfe 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 253 KB