𝔖 Bobbio Scriptorium
✦   LIBER   ✦

[Lecture Notes in Computer Science] Algorithm Theory - SWAT 2000 Volume 1851 || A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs

✍ Scribed by Berman, Piotr


Book ID
121015639
Publisher
Springer Berlin Heidelberg
Year
2000
Tongue
German
Weight
184 KB
Category
Article
ISBN
354044985X

No coin nor oath required. For personal study only.

✦ Synopsis


This Book Constitutes The Refereed Proceedings Of The 7th Scandinavian Workshop On Algorithm Theory, Swat 2000, Held In Bergen, Norway, In July 2000. The 43 Revised Full Papers Presented Together With 3 Invited Contributions Were Carefully Reviewed And Selected From A Total Of 105 Submissions. The Papers Are Organized In Sections On Data Structures, Dynamic Partitions, Graph Algorithms, Online Algorithms, Approximation Algorithms, Matchings, Network Design, Computational Geometry, Strings And Algorithm Engineering, External Memory Algorithms, Optimization, And Distributed And Fault-tolerant Computing.