PTAS for Ordered Instances of Resource Allocation Problems

DOI10.4230/LIPIcs.FSTTCS.2013.461zbMath1359.68311OpenAlexW112407858MaRDI QIDQ2963935

Arash Rafiey, Kamyar Khodamoradi, Georgios Stamoulis, Ramesh Krishnamurti

Publication date: 21 February 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.FSTTCS.2013.461

zbMATH Keywords

resource allocationapproximation algorithmsconvex bipartite graphs

Mathematics Subject Classification ID

Approximation algorithms (68W25) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Related Items (3)

Fair Packing of Independent Sets ⋮ Structural parameters for scheduling with assignment restrictions ⋮ Fair allocation of indivisible items with conflict graphs

This page was built for publication: PTAS for Ordered Instances of Resource Allocation Problems