Combinatorial Optimization and Theoretical Computer Science

Combinatorial Optimization and Theoretical Computer Science

Editor(s): Vangelis Th. Paschos

Published Online: 3 FEB 2010

Print ISBN: 9781848210219

Online ISBN: 9780470611098

DOI: 10.1002/9780470611098

About this Book

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.

Table of contents

    1. You have free access to this content
    2. Chapter 4

      Comparison of Expressiveness for Timed Automata and Time Petri Nets (pages 93–144)

      Béatrice Bérard, Franck Cassez, Serge Haddad, Didier Lime and Olivier-Henri Roux

    3. Chapter 5

      A “Maximum Node Clustering” Problem (pages 145–160)

      Giuliana Carello, Federico Della Croce, Andrea Grosso and Marco Locatelli

    4. Chapter 8

      Worst-case Complexity of Exact Algorithms for NP-hard Problems (pages 203–240)

      Federico Della Croce, Bruno Escoffier, Marcin Kamiński and Vangelis Th. Paschos

    5. Chapter 9

      The Online Track Assignment Problem (pages 241–257)

      Marc Demange, Gabriele Di Stefano and Benjamin Leroy-Beaulieu

    6. Chapter 10

      Complexity and Approximation Results for the Min Weighted Node Coloring Problem (pages 259–289)

      Marc Demange, Bruno Escoffier, Jérǒme Monnot, Vangelis Th. Paschos and Dominique de Werra

    7. Chapter 11

      Weighted Edge Coloring (pages 291–317)

      Marc Demange, Bruno Escoffier, Giorgio Lucarelli, Ioannis Milis, Jérǒme Monnot, Vangelis Th. Paschos and Dominique de Werra

    8. Chapter 14

      Algorithmic Games (pages 339–372)

      Aristotelis Giannakos, Vangelis Th. Paschos and Olivier Pottié

    9. You have free access to this content
    10. You have free access to this content
    11. You have free access to this content

SEARCH