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

• Introduction to the theory of complexity and approximation algorithms
  Thomas Jansen
  Lecture Notes in Computer Science 1367, 1998, pp. 5-28
• Introduction to randomized algorithms
  Artur Andrzejak
  Lecture Notes in Computer Science 1367, 1998, pp. 29-39
• Derandomization
  Detlef Sieling
  Lecture Notes in Computer Science 1367, 1998, pp. 41-61
• Proof checking and non-approximability
  Stefan Hougardy
  Lecture Notes in Computer Science 1367, 1998, pp. 63-82
• Proving the PCP-Theorem
  Volker Heun, Wolfgang Merkle, Ulrich Weigand
  Lecture Notes in Computer Science 1367, 1998, pp. 83-160
• Parallel repetition of MIP(2,1) systems
  Clemens Gröpl, Martin Skutella
  Lecture Notes in Computer Science 1367, 1998, pp. 161-177
• Bounds for approximating MaxLinEq3-2 and MaxEkSat
  Sebastian Seibert, Thomas Wilke
  Lecture Notes in Computer Science 1367, 1998, pp. 179-211
• Deriving non-approximability results by reductions
  Claus Rick, Hein Röhrig
  Lecture Notes in Computer Science 1367, 1998, pp. 213-233
• Optimal non-approximability of MaxClique
  Martin Mundhenk, Anna Slobodová
  Lecture Notes in Computer Science 1367, 1998, pp. 235-248
• The hardness of approximating set cover
  Alexander Wolff
  Lecture Notes in Computer Science 1367, 1998, pp. 249-262
• Semidefinite programming and its applications to approximation algorithms
  Thomas Hofmeister, Martin Hühne
  Lecture Notes in Computer Science 1367, 1998, pp. 263-298
• Dense instances of hard optimization problems
  Katja Wolf
  Lecture Notes in Computer Science 1367, 1998, pp. 299-311
• Polynomial time approximation schemes for geometric optimization problems in Euclidean metric spaces
  Richard Mayr, Annette Schelten
  Lecture Notes in Computer Science 1367, 1998, pp. 313-323