×

Uh-oh, it looks like your Internet Explorer is out of date.

For a better shopping experience, please upgrade now.

Approximation Algorithms for Combinatorial Optimization: Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings
     

Approximation Algorithms for Combinatorial Optimization: Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings

by Klaus Jansen (Editor), Samir Khuller (Editor)
 

This book constitutes the refereed proceedings of the Third Internatio nal Workshop on Approximation Algorithms for Combinatorial Optimizatio n Problems, APPROX 2000, held in Saarbruecken, Germany in September 20 00. The 22 revised full papers presented together with four invited co ntributions were carefully reviewed and selected from 68 submissions. The topics

Overview

This book constitutes the refereed proceedings of the Third Internatio nal Workshop on Approximation Algorithms for Combinatorial Optimizatio n Problems, APPROX 2000, held in Saarbruecken, Germany in September 20 00. The 22 revised full papers presented together with four invited co ntributions were carefully reviewed and selected from 68 submissions. The topics dealt with include design and analysis of approximation alg orithms, inapproximibility results, on-line problems, randomization te chniques, average-case analysis, approximation classes, scheduling pro blems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design , and various applications.

Product Details

ISBN-13:
9783540679967
Publisher:
Springer Berlin Heidelberg
Publication date:
10/02/2000
Series:
Lecture Notes in Computer Science Series , #1913
Edition description:
2000
Pages:
282
Product dimensions:
6.10(w) x 9.25(h) x 0.02(d)

Customer Reviews

Average Review:

Post to your social network

     

Most Helpful Customer Reviews

See all customer reviews