Show indexed articles as search result.

The articles of this volume will be reviewed individually.
Indexed articles:
Halldórsson, Magnús M., Approximation of independent sets in graphs, 1-13 [Zbl 0903.05044]
Shmoys, David B., Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems, 15-32 [Zbl 0907.90186]
Vazirani, Vijay V., The Steiner tree problem and its generalizations, 33-38 [Zbl 0902.68143]
Azar, Yossi; Epstein, Leah, Approximation schemes for covering and scheduling in related machines, 39-47 [Zbl 0911.90199]
Bar-Yehuda, Reuven, One for the price of two: A unified approach for approximating covering problems, 49-62 [Zbl 0908.90258]
Baur, Christoph; Fekete, Sándor P., Approximation of geometric dispersion problems. (Extended Abstract), 63-75 [Zbl 0908.68180]
Cheriyan, Joseph; Jordán, Tibor; Nutov, Zeev, Approximating \(k\)-outconnected subgraph problems, 76-88 [Zbl 0902.68144]
Epstein, Leah, Lower bounds for on-line scheduling with precedence constraints on identical machines, 89-98 [Zbl 0908.90162]
Hochbaum, Dorit S., Instant recognition of half integrality and 2-approximations, 99-110 [Zbl 0911.90261]
Hochbaum, Dorit S., The \(t\)-vertex cover problem: Extending the half integrality framework with budget constraints, 111-122 [Zbl 0908.90213]
Kellerer, Hans; Pferschy, Ulrich, A new fully polynomial approximation scheme for the knapsack problem, 123-134 [Zbl 0908.90190]
Kortsarz, Guy, On the hardness of approximating spanners, 135-146 [Zbl 0903.68141]
Kumar, Vijay, Approximating circular arc colouring and bandwidth allocation in all-optical ring networks, 147-158 [Zbl 0902.68145]
Schiermeyer, Ingo, Approximating maximum independent set in \(k\)-clique-free graphs, 159-168 [Zbl 0908.05053]
Spieksma, Frits C. R., Approximating an interval scheduling problem, 169-180 [Zbl 0902.68015]
Srivastav, Anand; Wolf, Katja, Finding dense subgraphs with semidefinite programming (extended abstract), 181-191 [Zbl 0911.90340]
Sviridenko, Maxim I., Best possible approximation algorithm for MAX SAT with cardinality constraint, 193-199 [Zbl 0908.68059]