Efficient Approximation and Online Algorithms

Recent Progress on Classical Combinatorial Optimization Problems and New Applications

  • Evripidis Bampis
  • Klaus Jansen
  • Claire Kenyon

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3484)

Table of contents

About this book


Computer algorithm algorithmics algorithms approximation classification combinatorial optimization complexity theory computational complexity computational discrete mathematics computational geometry computer science data mining on-line algorithms optimization

Editors and affiliations

  • Evripidis Bampis
    • 1
  • Klaus Jansen
    • 2
  • Claire Kenyon
    • 3
  1. 1.IBISC, CNRS FRE 3190Université d’Evry Val d’EssonneEvry CedexFrance
  2. 2.Institute for Computer ScienceUniversity of KielKielGermany
  3. 3.Brown UniversityProvidenceUSA

Bibliographic information

  • DOI
  • Copyright Information Springer-Verlag Berlin Heidelberg 2006
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Computer Science
  • Print ISBN 978-3-540-32212-2
  • Online ISBN 978-3-540-32213-9
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site
Industry Sectors
IT & Software