PTAS for ordered instances of resource allocation problems

DOI10.4230/LIPICS.FSTTCS.2013.461MaRDI QIDQ2963935zbMATH OpenOpenAlexFDO

Authors Kamyar Khodamoradi, Ramesh Krishnamurti, Arash Rafiey, Georgios Stamoulis

Publication date 21 February 2017

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

zbMATH Keywords

approximation algorithmsresource allocationconvex bipartite graphs

Mathematics Subject Classification ID

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

Recommendations

• Approximation Algorithms for the Max-Min Allocation Problem
• Restricted max-min fair allocations with inclusion-free intervals
• Restricted Max-Min Fair Allocation
• An approximation algorithm for max-min fair allocation of indivisible goods
• Santa claus meets hypergraph matchings

Cited in

(2)

• Fair Packing of Independent Sets
• Fair allocation of indivisible items with conflict graphs

This page was built for publication: PTAS for ordered instances of resource allocation problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2963935)