[Lecture Notes in Computer Science] Approximation and Online Algorithms Volume 5426 || A General Scheme for Designing Monotone Algorithms for Scheduling Problems with Precedence Constraints

✍ Scribed by Bampis, Evripidis; Skutella, Martin

• Book ID: 120586983
• Publisher: Springer Berlin Heidelberg
• Year: 2009
• Tongue: German
• Weight: 530 KB
• Category: Article
• ISBN: 3540939806
• DOI: 10.1007/978-3-540-93980-1_9

✦ Synopsis

This Book Constitutes The Thoroughly Refereed Post Workshop Proceedings Of The 6th International Workshop On Approximation And Online Algorithms, Waoa 2008, Held In Karlsruhe, Germany, In September 2008 As Part Of The Algo 2008 Conference Event. The 22 Revised Full Papers Presented Were Carefully Reviewed And Selected From 56 Submissions. The Workshop Covered Areas Such As Algorithmic Game Theory, Approximation Classes, Coloring And Partitioning, Competitive Analysis, Computational Finance, Cuts And Connectivity, Geometric Problems, Inapproximability Results, Mechanism Design, Network Design, Packing And Covering, Paradigms For Design And Analysis Of Approximation And Online Algorithms, Randomization Techniques, Real-world Applications, And Scheduling Problems.