✦ LIBER ✦

A Faster, Better Approximation Algorithm for the Minimum Latency Problem

✍ Scribed by Archer, Aaron; Levin, Asaf; Williamson, David P.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Better-Than-Greedy Approximation Algor

✍ Hassin, Refael; Levin, Asaf 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 186 KB

An improved approximation ratio for the

✍ Michel Goemans; Jon Kleinberg 📂 Article 📅 1998 🏛 Springer-Verlag 🌐 English ⚖ 860 KB

A faster approximation algorithm for the

✍ Kurt Mehlhorn 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 296 KB

A faster approximation algorithm for the

✍ Y. F. Wu; P. Widmayer; C. K. Wong 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 392 KB

A faster approximation algorithm for the

✍ Y. F. Wu; P. Widmayer; C. K. Wong 📂 Article 📅 1986 🏛 Springer-Verlag 🌐 English ⚖ 392 KB

A faster approximation algorithm for the

✍ Alexander Z. Zelikovsky 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 369 KB