Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen	Hilfe

Suche: Series=LNCS AND Volume=1444

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