Fully polynomial approximation for survivable flow allocation with max-min fairness

Samer Lahoud. Fully polynomial approximation for survivable flow allocation with max-min fairness. In Michel Diaz, Arturo Azcorra, Philippe Owezarski, Serge Fdida, editors, Proceedings of the 2005 ACM Conference on Emerging Network Experiment and Technology, CoNEXT 2005, Toulouse, France, October 24-27, 2005. pages 262-263, ACM, 2005. [doi]

Abstract

Abstract is missing.