[Lecture Notes in Computer Science] Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques Volume 4627 || Approximation Algorithms and Hardness for Domination with Propagation
✍ Scribed by Charikar, Moses; Jansen, Klaus; Reingold, Omer; Rolim, José D. P.
- Book ID
- 121362274
- Publisher
- Springer Berlin Heidelberg
- Year
- 2007
- Weight
- 647 KB
- Category
- Article
- ISBN
- 3540742085
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers
This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers
This is the joint refereed proceedings of the 9th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2006 and the 10th International Workshop on Randomization and Computation, RANDOM 2006. The book presents 44 carefully reviewed and revised full papers