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 [1]	Hilfe

Suche: Series=LNCS AND Volume=2337

• The distribution of values in the quadratic assignment problem
  Alexander Barvinok, Tamon Stephen
  Lecture Notes in Computer Science 2337, 2002, pp. 367-383
• A new subadditive approach to integer programming
  Diego Klabjan
  Lecture Notes in Computer Science 2337, 2002, pp. 384-400
• Improved approximation algorithms for resource allocation
  Gruia Calinescu, Amit Chakrabarti, Howard Karloff, Yuval Rabani
  Lecture Notes in Computer Science 2337, 2002, pp. 401-414
• Approximating the advertisement placement problem
  Ari Freund, Joseph (Seffi) Naor
  Lecture Notes in Computer Science 2337, 2002, pp. 415-424
• Algorithms for minimizing response time in broadcast scheduling
  Rajiv Gandhi, Samir Khuller, Yoo-Ah Kim, Yung-Chun (Justin) Wan
  Lecture Notes in Computer Science 2337, 2002, pp. 425-438
• Building edge-failure resilient networks
  Chandra Chekuri, Anupam Gupta, Amit Kumar, Joseph (Seffi) Naor, Danny Raz
  Lecture Notes in Computer Science 2337, 2002, pp. 439-456
• The demand matching problem
  Bruce Shepherd, Adrian Vetta
  Lecture Notes in Computer Science 2337, 2002, pp. 457-474
• The single-sink buy-at-bulk LP has constant integrality gap
  Kunal Talwar
  Lecture Notes in Computer Science 2337, 2002, pp. 475-486