Approximation Algorithms for Combinatorial Optimization:...

Main
Computers - Computer Science
Approximation Algorithms for...

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

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

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

0 / 0

0 comments

Sukakah Anda buku ini?

Bagaimana kualitas file yang diunduh?

Unduh buku untuk menilai kualitasnya

Bagaimana kualitas file yang diunduh?

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.

Kategori:

Computers - Computer Science

Tahun:

2002

Edisi:

Penerbit:

Springer-Verlag Berlin Heidelberg

Bahasa:

english

Halaman:

276

ISBN 10: