On allocations that maximize fairness

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2008, Pages 287-293

  Feige, Uriel ^a  

^a Weizmann Institute   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ALLOCATION PROBLEMS; CONSTANT FACTORS; LINEAR PROGRAMMING (LP) RELAXATION; OPTIMUM VALUE;

LINEARIZATION;

EID: 58449121421     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (7)

1. N. Alon and J. Spencer, The Probabilistic Method, Second Edition, Wiley-Interscience, 2000.
2. A. Asadpour, U. Feige and A. Saberi, Manuscript, 2007.
3. A. Asadpour and A. Saberi, An Approximation Algorithm for Max-Min Fair Allocation of Indivisible Goods, Proc 39th STOC, 114-121, 2007.
4. N. Bansal and M. Sviridenko, The Santa Clause problem, Proc 38th STOC, 31-40, 2006.
5. I. Bezakova and V. Dani, Allocating indivisible goods, SIGecom Exchanges, Vol. 5.3, 2005.
6. F. T. Leighton, B. Maggs and S. Rao, Packet Routing and Job-Shop Scheduling in 0(Congestion + Dilation) Steps, Combinatorica 14(2): 167-186, 1994.
7. G. Woeginger, A Polynomial-time approximation scheme for maximizing the minimum machine completion time, Oper. res. Lett., 20(4):149-154, 1997.