ENGLISH

Approximation Algorithms for Combinatorial Optimization: 5th International Workshop, APPROX 2002 Rome, Italy, September 17–21, 2002 Proceedings

By Klaus Jansen , Yuval Rabani (auth.) , Stefano Leonardi , Vijay Vazirani (eds.)

Book information

Publisher
Springer-Verlag Berlin Heidelberg
Year
2002
ISBN
978-3-540-44186-1, 978-3-540-45753-4, 3-540-44186-7
DOI
10.1007/3-540-45753-4
Language
english
Format
PDF
Filesize
4 MB (4019019 bytes)
Series
Lecture Notes in Computer Science 2462
Edition
1
Pages
276\280
Time added
2014-01-18 08:00:00
Algorithm Analysis and Problem Complexity; DiscretMathematical Programming

Description

This book constitutes the refereed proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2002, held in Rome, Italy in September 2002. The 20 revised full papers presented were carefully reviewed and selected from 54 submissions. Among the topics addressed are design and analysis of approximation algorithms, inapproximability results, online 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 applications to game theory and other fields.

Similar books