ENGLISH

Approximation Algorithms for Combinatiorial Optimization: International Workshop APPROX'98 Aalborg, Denmark, July 18–19, 1998 Proceedings

By Klaus Jansen , José Rolim (eds.) , MagnÚs M. Halldórsson (auth.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
1998
ISBN
978-3-540-64736-2, 978-3-540-69067-2
DOI
10.1007/BFb0053958
Language
english
Format
PDF
Filesize
3 MB (2976630 bytes)
Series
Lecture Notes in Computer Science 1444
Edition
1
Pages
207\202
Orientation
yes
Scanned
yes
Time added
2013-08-01 04:00:00
Algorithm Analysis and Problem Complexity; Discret

Description

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.

Similar books