✦ LIBER ✦

Approximating the Advertisement Placement Problem

✍ Scribed by Ari Freund; Joseph (Seffi) Naor

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximation algorithms for the Fault-T

✍ Li Yan; Marek Chrobak 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 149 KB

Approximating the balanced minimum evolu

✍ Samuel Fiorini; Gwenaël Joret 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 229 KB

Approximating the max-edge-coloring prob

✍ N. Bourgeois; G. Lucarelli; I. Milis; V.Th. Paschos 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 495 KB

The PMU Placement Problem

✍ Brueni, Dennis J.; Heath, Lenwood S. 📂 Article 📅 2005 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 215 KB

Approximating the multi-level bottleneck

✍ Trivikram Dokka; Anastasia Kouvela; Frits C.R. Spieksma 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 344 KB

Approximating the Maximum Internal Spann

✍ Gábor Salamon 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 933 KB