Ebook: Approximation Algorithms for Combinatiorial Optimization: International Workshop APPROX'98 Aalborg, Denmark, July 18–19, 1998 Proceedings

This book constitutes the refereed proceedings of the International Workshop on Approximation Algorithms for Combinatorical Optimization, APPROX'98, held in conjunction with ICALP'98 in Aalborg, Denmark, in July 1998.
The volume presents 14 revised full papers together with three invited papers selected from 37 submissions. The papers address the design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization techniques, average-case analysis, approximation classes, scheduling problems, routing and flow problems, coloring and partitioning, cuts and connectivity, packing and covering, geometric problems, network design, and various applications.

---

---

Content:
Front Matter....Pages -
Approximations of independent sets in graphs....Pages 1-13
Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems....Pages 15-32
The Steiner tree problem and its generalizations....Pages 33-38
Approximation schemes for covering and scheduling in related machines....Pages 39-47
One for the price of two: A unified approach for approximating covering problems....Pages 49-62
Approximation of geometric dispersion problems....Pages 63-75
Approximating k-outconnected subgraph problems....Pages 77-88
Lower bounds for on-line scheduling with precedence constraints on identical machines....Pages 89-98
Instant recognition of half integrality and 2-approximations....Pages 99-110
The t-vertex cover problem: Extending the half integrality framework with budget constraints....Pages 111-122
A new fully polynomial approximation scheme for the knapsack problem....Pages 123-134
On the hardness of approximating spanners....Pages 135-146
Approximating circular arc colouring and bandwidth allocation in all-optical ring networks....Pages 147-158
Approximating maximum independent set in k-clique-free graphs....Pages 159-168
Approximating an interval scheduling problem....Pages 169-180
Finding dense subgraphs with semidefinite programming....Pages 181-191
Best possible approximation algorithm for MAX SAT with cardinality constraint....Pages 193-199

---

Content:
Front Matter....Pages -
Approximations of independent sets in graphs....Pages 1-13
Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems....Pages 15-32
The Steiner tree problem and its generalizations....Pages 33-38
Approximation schemes for covering and scheduling in related machines....Pages 39-47
One for the price of two: A unified approach for approximating covering problems....Pages 49-62
Approximation of geometric dispersion problems....Pages 63-75
Approximating k-outconnected subgraph problems....Pages 77-88
Lower bounds for on-line scheduling with precedence constraints on identical machines....Pages 89-98
Instant recognition of half integrality and 2-approximations....Pages 99-110
The t-vertex cover problem: Extending the half integrality framework with budget constraints....Pages 111-122
A new fully polynomial approximation scheme for the knapsack problem....Pages 123-134
On the hardness of approximating spanners....Pages 135-146
Approximating circular arc colouring and bandwidth allocation in all-optical ring networks....Pages 147-158
Approximating maximum independent set in k-clique-free graphs....Pages 159-168
Approximating an interval scheduling problem....Pages 169-180
Finding dense subgraphs with semidefinite programming....Pages 181-191
Best possible approximation algorithm for MAX SAT with cardinality constraint....Pages 193-199
....