An optimal local approximation algorithm for max-min linear programs

Reference:

Patrik Floréen, Joel Kaasinen, Petteri Kaski, and Jukka Suomela. An optimal local approximation algorithm for max-min linear programs. In Friedhelm Meyer auf der Heide and Michael A. Bender, editors, Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (Calgary, August 11–13, 2009), pages 260–269, New York, 2009. ACM.

Suggested BibTeX entry:

@inproceedings{bibdb-export-pkaski-2009-13,
    address = {New York},
    author = {Patrik Flor{\'e}en and Joel Kaasinen and Petteri Kaski and Jukka Suomela},
    booktitle = {Proceedings of the 21st ACM Symposium on Parallelism in Algorithms and Architectures (Calgary, August 11--13, 2009)},
    editor = {Friedhelm Meyer auf der Heide and Michael A. Bender},
    pages = {260--269},
    publisher = {ACM},
    title = {An optimal local approximation algorithm for max-min linear programs},
    year = {2009},
}