Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems

Daniel Golovin, Vineet Goyal, R. Ravi. Pay Today for a Rainy Day: Improved Approximation Algorithms for Demand-Robust Min-Cut and Shortest Path Problems. In Bruno Durand, Wolfgang Thomas, editors, STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings. Volume 3884 of Lecture Notes in Computer Science, pages 206-217, Springer, 2006. [doi]

Abstract

Abstract is missing.