Books > Computing & IT > General theory of computing > Data structures
|
Buy Now
Approximation Algorithms for Combinatorial Optimization - 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings (Paperback, 2002 ed.)
Loot Price: R1,627
Discovery Miles 16 270
|
|
Approximation Algorithms for Combinatorial Optimization - 5th International Workshop, APPROX 2002, Rome, Italy, September 17-21, 2002. Proceedings (Paperback, 2002 ed.)
Series: Lecture Notes in Computer Science, 2462
Expected to ship within 10 - 15 working days
|
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.
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.