• Wiley Online Library will be disrupted on 18 May from 10:00-12:00 BST (05:00-07:00 EDT) for essential maintenance

Combinatorial Optimization and Theoretical Computer Science

Copyright © 2008 ISTE Ltd.

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

Product Information

About The Product

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
      Frontmatter (pages 1–21)

    2. Chapter 1

      The Complexity of Single Machine Scheduling Problems under Scenario-based Uncertainty (pages 23–35)

      Mohamed Ali Aloulou and Federico Della Croce

    3. Chapter 2

      Approximation of Multi-criteria Min and Max TSP(1, 2) (pages 37–69)

      Eric Angel, Evripidis Bampis, Laurent Gourvès and Jérǒme Monnot

    4. Chapter 3

      Online Models for Set-covering: the Flaw of Greediness (pages 71–92)

      Giorgio Ausiello, Aristotelis Giannakos and Vangelis Th. Paschos

    5. 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

    6. Chapter 5

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

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

    7. Chapter 6

      The Patrolling Problem: Theoretical and Experimental Results (pages 161–174)

      Yann Chevaleyre

    8. Chapter 7

      Restricted Classes of Utility Functions for Simple Negotiation Schemes: Sufficiency, Necessity and Maximality (pages 175–201)

      Yann Chevaleyre, Ulle Endriss and Nicolas Maudet

    9. 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

    10. Chapter 9

      The Online Track Assignment Problem (pages 241–257)

      Marc Demange, Gabriele Di Stefano and Benjamin Leroy-Beaulieu

    11. 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

    12. 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

    13. Chapter 12

      An Extensive Comparison of 0–1 Linear Programs for the Daily Satellite Mission Planning (pages 319–328)

      Virginie Gabrel

    14. Chapter 13

      Dantzig-Wolfe Decomposition for Linearly Constrained Stable Set Problem (pages 329–338)

      Virginie Gabrel

    15. Chapter 14

      Algorithmic Games (pages 339–372)

      Aristotelis Giannakos, Vangelis Th. Paschos and Olivier Pottié

    16. Chapter 15

      Flows! (pages 373–392)

      Michel Koskas and Cécile Murat

    17. Chapter 16

      The Complexity of the Exact Weighted Independent Set Problem (pages 393–432)

      Martin Milanič and Jérǒme Monnot

    18. Chapter 17

      The Labeled Perfect Matching in Bipartite Graphs: Complexity and (in)Approximability (pages 433–453)

      Jérǒme Monnot

    19. Chapter 18

      Bounded-size Path Packing Problems (pages 455–493)

      Jérǒme Monnot and Sophie Toulouse

    20. Chapter 19

      An Upper Bound for the Integer Quadratic Multi-knapsack Problem (pages 495–505)

      Dominique Quadri, Eric Soutif and Pierre Tolla

    21. You have free access to this content
      List of Authors (pages 507–509)

    22. You have free access to this content
      Index (pages 511–515)

    23. You have free access to this content
      Note to Publisher (page 516)

SEARCH