✦ LIBER ✦

Max-min Online Allocations with a Reordering Buffer

✍ Scribed by Epstein, Leah; Levin, Asaf; van Stee, Rob

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved semi-online makespan scheduling

✍ Sun, Hongyang; Fan, Rui 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 174 KB

A min-max resource allocation problem wi

✍ Jong-Shi Pang; Yu Chang-Sung 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 427 KB

A min—sum—max resource allocation proble

✍ SelÇuk Karabati; Panagiotis Kouvelis 📂 Article 📅 2000 🏛 Taylor and Francis Group 🌐 English ⚖ 130 KB

A min-sum-max resource allocation proble

✍ KARABATI, SELÇUK; KOUVELIS, PANAGIOTIS 📂 Article 📅 2000 🏛 Taylor and Francis Group 🌐 English ⚖ 412 KB

Power Allocation with Max–Min and Min–Ma

✍ Tang Lun, Yan Jing-lin, Li Qing, Chen Qian-bin, Wang Huan 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 793 KB

A characterization of max–min SIR-balanc

✍ Sławomir Stańczak; Michał Kaliszan; Nicholas Bambos 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 520 KB