1. APPROX 1998: Aalborg, Denmark

Klaus Jansen, Dorit S. Hochbaum (Eds.): Approximation Algorithms for Combinatorial Optimization, International Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings. Lecture Notes in Computer Science 1444 Springer 1998, ISBN 3-540-64736-8 BibTeX

@proceedings{DBLP:conf/approx/1998,
  editor    = {Klaus Jansen and
               Dorit S. Hochbaum},
  title     = {Approximation Algorithms for Combinatorial Optimization, International
               Workshop APPROX'98, Aalborg, Denmark, July 18-19, 1998, Proceedings},
  booktitle = {APPROX},
  publisher = {Springer},
  series    = {Lecture Notes in Computer Science},
  volume    = {1444},
  year      = {1998},
  isbn      = {3-540-64736-8},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Invited Talks

Magnús M. Halldórsson:
Approximations of Independent Sets in Graphs. 1-13
Electronic Edition (Springer LINK) BibTeX
David B. Shmoys:
Using Linear Programming in the Design and Analysis of Approximation Algorithms: Two Illustrative Problems. 15-32
Electronic Edition (Springer LINK) BibTeX
Vijay V. Vazirani:
The Steiner Tree Problem and Its Generalizations. 33-38
Electronic Edition (Springer LINK) BibTeX

Contributed Talks

Yossi Azar, Leah Epstein:
Approximation Schemes for Covering and Scheduling on Related Machines. 39-47
Electronic Edition (Springer LINK) BibTeX
Reuven Bar-Yehuda:
One for the Price of Two: A Unified Approach for Approximating Covering Problems. 49-62
Electronic Edition (Springer LINK) BibTeX
Christoph Baur, Sándor P. Fekete:
Approximation of Geometric Dispersion Problems. 63-75
Electronic Edition (Springer LINK) BibTeX
Joseph Cheriyan, Tibor Jordán, Zeev Nutov:
Approximating k-outconnected Subgraph Problems. 77-88
Electronic Edition (Springer LINK) BibTeX
Leah Epstein:
Lower Bounds for On-line Scheduling with Precedence Constraints on Identical Machines. 89-98
Electronic Edition (Springer LINK) BibTeX
Dorit S. Hochbaum:
Instant Recognition of Half Integrality and 2-Approximations. 99-110
Electronic Edition (Springer LINK) BibTeX
Dorit S. Hochbaum:
The t-Vertex Cover Problem: Extending the Half Integrality Framework with Budget Constraints. 111-122
Electronic Edition (Springer LINK) BibTeX
Hans Kellerer, Ulrich Pferschy:
A New Fully Polynomial Approximation Scheme for the Knapsack Problem. 123-134
Electronic Edition (Springer LINK) BibTeX
Guy Kortsarz:
On the Hardness of Approximation Spanners. 135-146
Electronic Edition (Springer LINK) BibTeX
Vijay Kumar:
Approximating Circular Arc Colouring and Bandwidth Allocation in All-Optical Ring Networks. 147-158
Electronic Edition (Springer LINK) BibTeX
Ingo Schiermeyer:
Approximating Maximum Independent Set in k-Clique-Free Graphs. 159-168
Electronic Edition (Springer LINK) BibTeX
Frits C. R. Spieksma:
Approximating an Interval Scheduling Problem. 169-180
Electronic Edition (Springer LINK) BibTeX
Anand Srivastav, Katja Wolf:
Finding Dense Subgraphs with Semidefinite Programming. 181-191
Electronic Edition (Springer LINK) BibTeX
Maxim Sviridenko:
Best Possible Approximation Algorithm for MAX SAT with Cardinality Constraint. 193-199
Electronic Edition (Springer LINK) BibTeX