Approximation Algorithms for Combinatorial Optimization: Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (Lecture Notes in Computer Science, 1913)
ISBN-13:
9783540679967
ISBN-10:
3540679960
Edition:
2000
Author:
Klaus Jansen, Samir Khuller
Publication date:
2000
Publisher:
Springer
Format:
Paperback
292 pages
FREE US shipping
Book details
ISBN-13:
9783540679967
ISBN-10:
3540679960
Edition:
2000
Author:
Klaus Jansen, Samir Khuller
Publication date:
2000
Publisher:
Springer
Format:
Paperback
292 pages
Summary
Approximation Algorithms for Combinatorial Optimization: Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (Lecture Notes in Computer Science, 1913) (ISBN-13: 9783540679967 and ISBN-10: 3540679960), written by authors
Klaus Jansen, Samir Khuller, was published by Springer in 2000.
With an overall rating of 3.6 stars, it's a notable title among other
AI & Machine Learning
(Information Theory, Computer Science, Data Modeling & Design, Databases & Big Data, Data Processing, Graphics & Design, Algorithms, Programming, Graphics & Multimedia, Microsoft Programming) books. You can easily purchase or rent Approximation Algorithms for Combinatorial Optimization: Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings (Lecture Notes in Computer Science, 1913) (Paperback) from BooksRun,
along with many other new and used
AI & Machine Learning
books
and textbooks.
And, if you're looking to sell your copy, our current buyback offer is $0.3.
Description
This book constitutes the refereed proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2000, held in Saarbrücken, Germany in September 2000. The 22 revised full papers presented together with four invited contributions were carefully reviewed and selected from 68 submissions. The topics dealt with include design and analysis of approximation algorithms, inapproximibility 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.
We would LOVE it if you could help us and other readers by reviewing the book
Book review
Congratulations! We have received your book review.
{user}
{createdAt}
by {truncated_author}