A new approximation technique for resource‐allocation problems

DOI10.1002/rsa.20756zbMath1405.90073OpenAlexW1545921760MaRDI QIDQ4584915

Aravind Srinivasan, Barna Saha

Publication date: 5 September 2018

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20756

zbMATH Keywords

schedulingapproximation algorithmsrandomized algorithmsroundingintegrality gap

Mathematics Subject Classification ID

Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Random walks on graphs (05C81)

Related Items (5)

Multistage online maxmin allocation of indivisible entities ⋮ Resource time-sharing for IoT applications with deadlines ⋮ Polynomial-time combinatorial algorithm for general max-min fair allocation ⋮ General max-min fair allocation ⋮ Unnamed Item

This page was built for publication: A new approximation technique for resource‐allocation problems