@incollection{Halldorsson/98,
AUTHOR = {Halld{\'{o}}rsson, Magn{\'{u}}s M.},
TITLE = {Approximations of independent sets in graphs},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {1-13},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Shmoys/98,
AUTHOR = {Shmoys, David B.},
TITLE = {Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {15-32},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Vazirani/98,
AUTHOR = {Vazirani, Vijay V.},
TITLE = {The Steiner tree problem and its generalizations},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {33-38},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Azar-Epstein/98,
AUTHOR = {Azar, Yossi and Epstein, Leah},
TITLE = {Approximation schemes for covering and scheduling in related machines},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {39-47},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Bar-Yehuda/98,
AUTHOR = {Bar-Yehuda, Reuven},
TITLE = {One for the price of two: A unified approach for approximating covering problems},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {49-62},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Baur-Fekete/98,
AUTHOR = {Baur, Christoph and Fekete, S{\'{a}}ndor P.},
TITLE = {Approximation of geometric dispersion problems},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {63-75},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Cheriyan-Jordan-Nutov/98,
AUTHOR = {Cheriyan, Joseph and Jord{\'{a}}n, Tibor and Nutov, Zeev},
TITLE = {Approximating $k$-outconnected subgraph problems},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {77-88},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Epstein/98,
AUTHOR = {Epstein, Leah},
TITLE = {Lower bounds for on-line scheduling with precedence constraints on identical machines},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {89-98},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Hochbaum/98b,
AUTHOR = {Hochbaum, Dorit S.},
TITLE = {Instant recognition of half integrality and 2-approximations},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {99-110},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Hochbaum/98c,
AUTHOR = {Hochbaum, Dorit S.},
TITLE = {The $t$-vertex cover problem: Extending the half integrality framework with budget constraints},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {111-122},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Kellerer-Pferschy/98,
AUTHOR = {Kellerer, Hans and Pferschy, Ulrich},
TITLE = {A new fully polynomial approximation scheme for the knapsack problem},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {123-134},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Kortsarz/98,
AUTHOR = {Kortsarz, Guy},
TITLE = {On the hardness of approximating spanners},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {135-146},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Kumar/98,
AUTHOR = {Kumar, Vijay},
TITLE = {Approximating circular arc colouring and bandwidth allocation in all-optical ring networks},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {147-158},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Schiermeyer/98,
AUTHOR = {Schiermeyer, Ingo},
TITLE = {Approximating maximum independent set in $k$-clique-free graphs},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {159-168},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Spieksma/98,
AUTHOR = {Spieksma, Frits C.R.},
TITLE = {Approximating an interval scheduling problem},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {169-180},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Srivastav-Wolf/98,
AUTHOR = {Srivastav, Anand and Wolf, Katja},
TITLE = {Finding dense subgraphs with semidefinite programming},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {181-191},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}
@incollection{Sviridenko/98,
AUTHOR = {Sviridenko, Maxim I.},
TITLE = {Best possible approximation algorithm for MAX SAT with cardinality constraint},
BOOKTITLE = {Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization, APPROX'98 (Aalborg, Denmark, July 18-19, 1998)},
SERIES = {LNCS},
VOLUME = {1444},
PAGES = {193-199},
YEAR = {1998},
EDITOR = {Jansen, Klaus and Rolim, Jos{\'{e}}},
PUBLISHER = {Springer-Verlag},
ADDRESS = {Berlin-Heidelberg-New York-Barcelona-Budapest-Hong Kong-London-Milan-Paris-Singapore-Tokyo},
}