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