Combinatorial optimization and theoretical computer science interfaces and perspectives : 30th anniversary of the LAMSADE /
Corporate Author: | |
---|---|
Other Authors: | |
Format: | Electronic |
Language: | English |
Published: |
London, UK : Hoboken, NJ :
ISTE ; Wiley,
c2008.
|
Subjects: | |
Online Access: | ebrary View fulltext via EzAccess John Wiley |
Table of Contents:
- Combinatorial Optimization and Theoretical Computer Science; Contents; Preface; Chapter 1. The Complexity of Single Machine Scheduling Problems under Scenario-based Uncertainty; Chapter 2. Approximation of Multi-criteria Min and Max TSP(1, 2); Chapter 3. Online Models for Set-covering: The Flaw of Greediness; Chapter 4. Comparison of Expressiveness for Timed Automata and Time Petri Nets; Chapter 5. A "Maximum Node Clustering" Problem; Chapter 6. The Patrolling Problem: Theoretical and Experimental Results