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=1412

• An implementation of a combinatorial approximation algorithm for minimum-cost multicommodity flow
  Andrew V. Goldberg, Jeffrey D. Oldham, Serge Plotkin, Cliff Stein
  Lecture Notes in Computer Science 1412, 1998, pp. 338-352
• Non-approximability results for scheduling problems with minsum criteria
  Han Hoogeveen, Petra Schuurman, Gerhard J. Woeginger
  Lecture Notes in Computer Science 1412, 1998, pp. 353-366
• Approximation bounds for a general class of precedence constrained parallel machine scheduling problems
  Alix Munier, Maurice Queyranne, Andreas S. Schulz
  Lecture Notes in Computer Science 1412, 1998, pp. 367-382
• An efficient approximation algorithm for minimizing makespan on uniformly related machines
  Chandra Chekuri, Michael Bender
  Lecture Notes in Computer Science 1412, 1998, pp. 383-393
• On the relationship between combinatorial and LP-based approaches to NP-hard scheduling problems
  R.N. Uma, Joel Wein
  Lecture Notes in Computer Science 1412, 1998, pp. 394-408
• Polyhedral combinatorics of quadratic assignment problems with less objects than locations
  Volker Kaibel
  Lecture Notes in Computer Science 1412, 1998, pp. 409-422
• Incorporating inequality constraints in the spectral bundle method
  Christoph Helmberg, Krzysztof C. Kiwiel, Franz Rendl
  Lecture Notes in Computer Science 1412, 1998, pp. 423-435