Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques

12th International Workshop, APPROX 2009, and 13th International Workshop, RANDOM 2009, Berkeley, CA, USA, August, 21-23, 2009, Proceedings

by Klaus Jansen, Irit Dinur, Seffi Naor

740 pages· 2009· ISBN 9783642036842
About
This book constitutes the joint refereed proceedings of the 12th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2009, and the 13th International Workshop on Randomization and Computation, RANDOM 2009, held in Berkely, CA, USA, in August 2009. The 25 revised full papers of the APPROX 2009 workshop and the 28 revised full papers of the RANDOM 2009 workshop included in this volume, were carefully reviewed and selected from 56 and 58 submissions, respectively. APPROX focuses on algorithmic and complexity issues surrounding the development of efficient approximate solutions to computationally difficult problems. RANDOM is concerned with applications of randomness to computational and combinatorial problems.

Discuss Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques with other readers

Join or start a book club for Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 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, Randomization, and Combinatorial Optimization. Algorithms and Techniques?

Sign up free on Readfeed, then browse public clubs or start your own club with Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.

Can I discuss Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques with other readers online?

Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques 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.