✦ LIBER ✦

A Near-Tight Approximation Algorithm for the Robot Localization Problem

✍ Scribed by Koenig, Sven; Mitchell, Joseph S. B.; Mudgal, Apurva; Tovey, Craig

Book ID: 118180860
Publisher: Society for Industrial and Applied Mathematics
Year: 2009
Tongue: English
Weight: 491 KB
Volume: 39
Category: Article
ISSN: 0097-5397
DOI: 10.1137/070682885

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight Approximation Ratio of a General G

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimumk-Way Cut Problem

✍ Mingyu Xiao; Leizhen Cai; Andrew Chi-Chih Yao 📂 Article 📅 2009 🏛 Springer 🌐 English ⚖ 318 KB

A fast approximation algorithm for the m

A fast approximation algorithm for the multicovering problem

✍ Nicholas G. Hall; Dorit S. Hochbaum 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 255 KB

A new approximation algorithm for the -f

A new approximation algorithm for the -facility location problem

✍ Peng Zhang 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 405 KB

A successive approximation algorithm for

A successive approximation algorithm for the multiple knapsack problem

✍ Zhenbo Wang; Wenxun Xing 📂 Article 📅 2007 🏛 Springer US 🌐 English ⚖ 420 KB

A simple approximation algorithm for the

A simple approximation algorithm for the weighted matching problem

✍ Doratha E Drake; Stefan Hougardy 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 61 KB

We present a linear time approximation algorithm with a performance ratio of 1/2 for finding a maximum weight matching in an arbitrary graph. Such a result is already known and is due to Preis [

A 2-approximation algorithm for the netw

A 2-approximation algorithm for the network substitution problem

✍ Nicolai N. Pisaruk 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 129 KB