Combinatorial Optimization and Theoretical Computer Science
Interfaces and Perspectives
1st Edition
Will be published approx. on 10. March 2008
Book
Hardback
544 pages
978-1-84821-021-9 (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
Language
English
Place of publication
London
United Kingdom
Target group
College/higher education
Product notice
Unsewn / adhesive bound
Paper over boards
Dimensions
Height: 237 mm
Width: 158 mm
Thickness: 34 mm
Weight
898 gr
ISBN-13
978-1-84821-021-9 (9781848210219)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Vangelis Th. Paschos
Combinatorial Optimization and Theoretical Computer Science
Interfaces and Perspectives
E-Book
01/2010
Wiley-ISTE
€215.99
Available for download
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 Problems under Scenario-based Uncertainty (M. A. Aloulou, F. Della Croce). Chapter 2. (Non)-Approximability Results for the Multi-criteria Min and Max TSP(1, 2) (E. Angel, E. Bampis, L. Gourves, J. Monnot).
Chapter 3. Online Models for Set-covering: the Flaw of Greediness (G. Ausiello, A. Giannakos, V. Th. Paschos).
Chapter 4. Comparison of Expressiveness for Timed Automata and Time Petri Nets (B. Berard, 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 Experimental Results (Y. Chevaleyre).
Chapter 7. Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity and Maximality (Y. Chevaleyre, U. Endriss, N. Maudet).
Chapter 8. Worst-case Complexity of Exact Algorithms for NP-hard Problems (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 Min Weighted 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 for the Daily Satellite Mission Planning (Virginie Gabrel).
Chapter 13. Dantzig-Wolfe Decomposition for Linearly Constrained Stable Set Problem (Virginie Gabrel).
Chapter 14. Algorithmic Games (Aristotelis Giannakos et al).
Chapter 15. Flows! (Michel Koskas, Cecile Murat).
Chapter 16. The Complexity of the Exact Weighted Independent Set Problem (Martin Milanic, Jerome Monnot).
Chapter 17. The Labeled Perfect Matching in Bipartite Graphs: Complexity and (in) Approximability (Jerome Monnot).
Chapter 18. Complexity and Approximation Results for Bounded-size Paths Packing Problems (Jerome Monnot, Sophie Toulouse).
Chapter 19. An Upper Bound for the Integer Quadratic Multi-knapsack Problem (Dominique Quadri, Eric Soutif, Pierre Tolla).
List of Authors.
Index.
Chapter 3. Online Models for Set-covering: the Flaw of Greediness (G. Ausiello, A. Giannakos, V. Th. Paschos).
Chapter 4. Comparison of Expressiveness for Timed Automata and Time Petri Nets (B. Berard, 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 Experimental Results (Y. Chevaleyre).
Chapter 7. Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity and Maximality (Y. Chevaleyre, U. Endriss, N. Maudet).
Chapter 8. Worst-case Complexity of Exact Algorithms for NP-hard Problems (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 Min Weighted 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 for the Daily Satellite Mission Planning (Virginie Gabrel).
Chapter 13. Dantzig-Wolfe Decomposition for Linearly Constrained Stable Set Problem (Virginie Gabrel).
Chapter 14. Algorithmic Games (Aristotelis Giannakos et al).
Chapter 15. Flows! (Michel Koskas, Cecile Murat).
Chapter 16. The Complexity of the Exact Weighted Independent Set Problem (Martin Milanic, Jerome Monnot).
Chapter 17. The Labeled Perfect Matching in Bipartite Graphs: Complexity and (in) Approximability (Jerome Monnot).
Chapter 18. Complexity and Approximation Results for Bounded-size Paths Packing Problems (Jerome Monnot, Sophie Toulouse).
Chapter 19. An Upper Bound for the Integer Quadratic Multi-knapsack Problem (Dominique Quadri, Eric Soutif, Pierre Tolla).
List of Authors.
Index.