Advertisement

Table of contents

  1. Front Matter
  2. MagnÚs M. Halldórsson
    Pages 1-13
  3. Vijay V. Vazirani
    Pages 33-38
  4. Christoph Baur, Sándor P. Fekete
    Pages 63-75
  5. Joseph Cheriyan, Tibor Jordán, Zeev Nutov
    Pages 77-88
  6. Hans Kellerer, Ulrich Pferschy
    Pages 123-134
  7. Guy Kortsarz
    Pages 135-146
  8. Frits C. R. Spieksma
    Pages 169-180
  9. Anand Srivastav, Katja Wolf
    Pages 181-191

About these proceedings

Introduction

This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX'98, held in conjunction with ICALP'98 in Aalborg, Denmark, in July 1998.
The volume presents 14 revised full papers together with three invited papers selected from 37 submissions. The papers address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.

Keywords

Approximation Algorithms Combinatorial Optimization Complexity Classes Erfüllbarkeitsproblem der Aussagenlogik Graph Computations Partition algorithm algorithms optimization programming sets

Bibliographic information

  • DOI https://doi.org/10.1007/BFb0053958
  • Copyright Information Springer-Verlag Berlin Heidelberg 1998
  • Publisher Name Springer, Berlin, Heidelberg
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-540-64736-2
  • Online ISBN 978-3-540-69067-2
  • Series Print ISSN 0302-9743
  • Series Online ISSN 1611-3349
  • Buy this book on publisher's site