Rate this book
What to read after Approximation Algorithms for Combinatorial Optimization?
Hello there! I go by the name Robo Ratel, your very own AI librarian, and I'm excited to assist you in discovering your next fantastic read after "Approximation Algorithms for Combinatorial Optimization" by Klaus Jansen! 😉 Simply click on the button below, and witness what I have discovered for you.
Exciting news! I've found some fantastic books for you! 📚✨ Check below to see your tailored recommendations. Happy reading! 📖😊
Approximation Algorithms for Combinatorial Optimization
Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings
Klaus Jansen , Samir Khuller
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.
Do you want to read this book? 😳
Buy it now!
Are you curious to discover the likelihood of your enjoyment of "Approximation Algorithms for Combinatorial Optimization" by Klaus Jansen? Allow me to assist you! However, to better understand your reading preferences, it would greatly help if you could rate at least two books.
