Combinatorial Optimization and Theoretical Computer Science
Interfaces and Perspectives
Published on 21. January 2010
544 pages
978-0-470-39367-3 (ISBN)
Description
This volume is dedicated to the theme "Combinatorial Optimization - Theoretical Computer Science: Interfaces and Perspectives" and has two main objectives: the first is to show that bringing together operational research and theoretical computer science can yield useful results for a range of applications, while the second is to demonstrate the quality and range of research conducted by the LAMSADE in these areas.
More details
Other editions
Additional editions
Vangelis Th. Paschos
Combinatorial Optimization and Theoretical Computer Science
Interfaces and Perspectives
Book
03/2008
1st Edition
Wiley-ISTE
€253.50
Article not available at the moment
Person
Vangelis Th. Paschos is a Professor of Computer Science at the University of Paris-Dauphine, France.
Content
Chapter 1. The Complexity of Single Machine Scheduling Problemsunder Scenario-based Uncertainty (M. A. Aloulou, F. Della Croce).
Chapter 2. (Non)-Approximability Results for the Multi-criteriaMin and Max TSP(1, 2) (E. Angel, E. Bampis, L. Gourvès, J.Monnot).
Chapter 3. Online Models for Set-covering: the Flaw ofGreediness (G. Ausiello, A. Giannakos, V. Th. Paschos).
Chapter 4. Comparison of Expressiveness for Timed Automata andTime Petri Nets (B. Bérard, F. Cassez, S. Haddad, D.Lime, O. H. Roux).
Chapter 5. A "Maximum Node Clustering" Problem (G.Carello, F. Della Croce, A. Grosso, M. Locatelli).
Chapter 6. The Patrolling Problem: Theoretical and ExperimentalResults (Y. Chevaleyre).
Chapter 7. Restricted Classes of Utility Functions for SimpleNegotiation Schemes: Sufficiency, Necessity and Maximality (Y.Chevaleyre, U. Endriss, N. Maudet).
Chapter 8. Worst-case Complexity of Exact Algorithms for NP-hardProblems (F. Della Croce, B. Escoffier, M. Kaminski, V. Th.Paschos).
Chapter 9. The Online Track Assignment Problem (M. Demange, G.Di Stefano, B. Leroy-Beaulieu).
Chapter 10. Complexity and Approximation Results for the MinWeighted Node Coloring Problem (M. Demange et al).
Chapter 11. Weighted Edge Coloring (M. Demange et al).
Chapter 12. An Extensive Comparison of 0-1 Linear Programs forthe Daily Satellite Mission Planning (Virginie Gabrel).
Chapter 13. Dantzig-Wolfe Decomposition for Linearly ConstrainedStable Set Problem (Virginie Gabrel).
Chapter 14. Algorithmic Games (Aristotelis Giannakos et al).
Chapter 15. Flows! (Michel Koskas, Cécile Murat).
Chapter 16. The Complexity of the Exact Weighted Independent SetProblem (Martin Milanic, Jérôme Monnot).
Chapter 17. The Labeled Perfect Matching in Bipartite Graphs:Complexity and (in) Approximability (Jérôme Monnot).
Chapter 18. Complexity and Approximation Results forBounded-size Paths Packing Problems (Jérôme Monnot,Sophie Toulouse).
Chapter 19. An Upper Bound for the Integer QuadraticMulti-knapsack Problem (Dominique Quadri, Eric Soutif, PierreTolla).
List of Authors.
Index.
