Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms

Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos. Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. In Frank K. H. A. Dehne, Marina L. Gavrilova, Jörg-Rüdiger Sack, Csaba D. Tóth, editors, Algorithms and Data Structures, 11th International Symposium, WADS 2009, Banff, Canada, August 21-23, 2009. Proceedings. Volume 5664 of Lecture Notes in Computer Science, pages 507-518, Springer, 2009. [doi]

Abstract

Abstract is missing.