Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract

José R. Correa, Andreas S. Schulz, Nicolás E. Stier Moses. Computational Complexity, Fairness, and the Price of Anarchy of the Maximum Latency Problem: Extended Abstract. In George L. Nemhauser, Daniel Bienstock, editors, Integer Programming and Combinatorial Optimization, 10th International IPCO Conference, New York, NY, USA, June 7-11, 2004, Proceedings. Volume 3064 of Lecture Notes in Computer Science, pages 59-73, Springer, 2004. [doi]

Abstract

Abstract is missing.