Approximation Algorithms for Combinatorial Optimization
Third International Workshop, APPROX 2000 Saarbrücken, Germany, September 5-8, 2000 Proceedings
by Klaus Jansen, Samir Khuller
Discuss Approximation Algorithms for Combinatorial Optimization with other readers
Join or start a book club for Approximation Algorithms for Combinatorial Optimization on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Approximation Algorithms for Combinatorial Optimization?
Sign up free on Readfeed, then browse public clubs or start your own club with Approximation Algorithms for Combinatorial Optimization as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Approximation Algorithms for Combinatorial Optimization with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Approximation Algorithms for Combinatorial Optimization with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.