ISBN: 3-540-64736-8
TITLE: Approximation Algorithms for Combinatorial Optimization
AUTHOR: Jansen, Klaus; Rolim, Jose (Eds.)
TOC:

Invited Talks 
Approximations of independent sets in graphs 1 
Magns M. Halldrsson 
Using linear programming in the design and analysis of 15 
approximation algorithms: Two illustrative problems 
David B. Shmoys 
The steiner tree problem and its generalizations 33 
Vijay V. Vazirani 
Contributed Talks 
Approximation schemes for covering and scheduling on 39 
related machines 
Yossi Azar and Leah Epstein 
One for the price of two: A unified approach for 49 
approximating covering problems 
Reuven Bar-Yehuda 
Approximation of geometric dispersion problems 63 
Christoph Baur and Sndor P. Fekete 
Approximating k-outconnected subgraph problems 77 
Joseph Cheriyan, Tibor Jordn and Zeev Nutov 
Lower bounds for on-line scheduling with precedence 89 
constraints on identical machines 
Leah Epstein 
Instant recognition of half integrality and 2-approximations 99 
Dorit S. Hochbaum 
The t - vertex cover problem: Extending the half integrality 111 
framework with budget constraints 
Dorit S. Hochbaum 
A new fully polynomial approximation scheme for the 123 
knapsack problem 
Hans Kellerer and Ulrich Pferschy 
On the hardness of approximating spanners 135 
Guy Kortsarz 
Approximating circular arc colouring and bandwidth 147 
allocation in all-optical ring networks 
Vijay Kumar 
Approximating maximum independent set in k-clique-free 159 
graphs 
Ingo Schiermeyer 
Approximating an interval scheduling problem 169 
Frits C.R. Spieksma 
Finding dense subgraphs with semidefinite programming 181 
Anand Srivastav and Katja Wolf 
Best possible approximation algorithm for MAX SAT 193 
with cardinality constraint 
Maxim I. Sviridenko 
Author Index 201 
END
