Approximation and Online Algorithms

Approximation and Online Algorithms

4.11 - 1251 ratings - Source

This book constitutes the thoroughly refereed post-proceedings of the First International Workshop on Approximation and Online Algorithms, WAOA 2003, held in Budapest, Hungary in September 2003. The 19 revised full papers presented together with 5 invited abstracts of the related ARACNE mini-symposium were carefully selected from 41 submissions during two rounds of reviewing and improvement. Among the topics addressed are competitive analysis, inapproximability results, randomization techniques, approximation classes, scheduling, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and applications to game theory and financial problems.First International Workshop, WAOA 2003, Budapest, Hungary, September 16-18, 2003, Revised Papers Roberto Solis-Oba, Klaus Jansen ... We prove that it is to NP-complete to verify whether a given instance of the 6-machine OB-problem has a normal schedule. ... The machines are prescribed to execute the following jobs: M1: {b1, m1, s1}, M3: {b2, m1, s2}, M5: {b3, m2, s1}, M2: {b1, m2, s2}, M4: {b2, m2 anbsp;...

Title:Approximation and Online Algorithms
Author:Roberto Solis-Oba, Klaus Jansen
Publisher:Springer Science & Business Media - 2004-02-12


You Must CONTINUE and create a free account to access unlimited downloads & streaming