๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 6196 || Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree Graphs

โœ Scribed by Thai, My T.; Sahni, Sartaj


Book ID
118265634
Publisher
Springer Berlin Heidelberg
Year
2010
Weight
161 KB
Category
Article
ISBN
3642140319

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


[Lecture Notes in Computer Science] Appr
โœ Dรญaz, Josep; Jansen, Klaus; Rolim, Josรฉ D. P.; Zwick, Uri ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Springer Berlin Heidelberg ๐ŸŒ English โš– 534 KB

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