Resource Allocation for Covering Time Varying Demands
From MaRDI portal
Publication:3092259
DOI10.1007/978-3-642-23719-5_46zbMath1346.91108OpenAlexW45352664MaRDI QIDQ3092259
Sambuddha Roy, Yogish Sabharwal, Amit Kumar, Venkatesan T. Chakaravarthy
Publication date: 16 September 2011
Published in: Algorithms – ESA 2011 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-23719-5_46
Transportation, logistics and supply chain management (90B06) Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (5)
Resource allocation problem under single resource assignment ⋮ On improved interval cover mechanisms for crowdsourcing markets ⋮ Improved Algorithm for Resource Allocation Problems ⋮ How unsplittable-flow-covering helps scheduling with job-dependent cost functions ⋮ Set cover problems with small neighborhood covers
This page was built for publication: Resource Allocation for Covering Time Varying Demands