Editors:
- Includes supplementary material: sn.pub/extras
Part of the book series: Lecture Notes in Computer Science (LNCS, volume 1444)
Conference series link(s): APPROX: International Workshop on Approximation Algorithms for Combinatorial Optimization
Conference proceedings info: APPROX 1998.
Buy it now
Buying options
Tax calculation will be finalised at checkout
Other ways to access
This is a preview of subscription content, log in via an institution to check for access.
Table of contents (17 papers)
-
Front Matter
About this book
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.
Bibliographic Information
Book Title: Approximation Algorithms for Combinatorial Optimization
Book Subtitle: International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings
Editors: Klaus Jansen, José Rolim
Series Title: Lecture Notes in Computer Science
DOI: https://doi.org/10.1007/BFb0053958
Publisher: Springer Berlin, Heidelberg
-
eBook Packages: Springer Book Archive
Copyright Information: Springer-Verlag Berlin Heidelberg 1998
Softcover ISBN: 978-3-540-64736-2Published: 01 July 1998
eBook ISBN: 978-3-540-69067-2Published: 30 July 2003
Series ISSN: 0302-9743
Series E-ISSN: 1611-3349
Edition Number: 1
Number of Pages: IX, 207
Topics: Theory of Computation, Algorithm Analysis and Problem Complexity, Discrete Mathematics in Computer Science, Calculus of Variations and Optimal Control; Optimization, Computer Graphics