Combinatorial Algorithm for Restricted Max-Min Fair Allocation
暂无分享,去创建一个
Ola Svensson | Christos Kalaitzis | Chidambaram Annamalai | O. Svensson | Christos Kalaitzis | Chidambaram Annamalai
[1] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[2] Ivona Bezáková,et al. Allocating indivisible goods , 2005, SECO.
[3] Jan Karel Lenstra,et al. Approximation algorithms for scheduling unrelated parallel machines , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[4] Uriel Feige,et al. On allocations that maximize fairness , 2008, SODA '08.
[5] Uriel Feige,et al. On Estimation Algorithms vs Approximation Algorithms , 2008, FSTTCS.
[6] Ola Svensson,et al. Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation , 2012, ICALP.
[7] Uriel Feige,et al. Santa claus meets hypergraph matchings , 2008, TALG.
[8] Sanjeev Khanna,et al. On Allocating Goods to Maximize Fairness , 2009, 2009 50th Annual IEEE Symposium on Foundations of Computer Science.
[9] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[10] Xin-She Yang,et al. Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.
[11] Venkatesan Guruswami,et al. MaxMin allocation via degree lower-bounded arborescences , 2009, STOC '09.
[12] Ola Svensson,et al. Santa Claus schedules jobs on unrelated machines , 2010, STOC '11.
[13] G. Hardy,et al. Asymptotic formulae in combinatory analysis , 1918 .
[14] Amin Saberi,et al. An approximation algorithm for max-min fair allocation of indivisible goods , 2007, STOC '07.
[15] Ronald L. Rivest,et al. Introduction to Algorithms, third edition , 2009 .
[16] Nikhil Bansal,et al. The Santa Claus problem , 2006, STOC '06.
[17] Chidambaram Annamalai,et al. Finding Perfect Matchings in Bipartite Hypergraphs , 2015, SODA.
[18] U. Feige,et al. On Estimation Algorithms versus Approximation Algorithms , 2008 .
[19] Aravind Srinivasan,et al. New Constructive Aspects of the Lovasz Local Lemma , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[20] Aravind Srinivasan,et al. A new approximation technique for resource‐allocation problems , 2010, ICS.
[21] G. Hardy,et al. Asymptotic Formulaæ in Combinatory Analysis , 1918 .
[22] Penny E. Haxell,et al. A condition for matchability in hypergraphs , 1995, Graphs Comb..