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

• All-norm approximation for scheduling on identical machines
  Yossi Azar, Shai Taub
  Lecture Notes in Computer Science 3111, 2004, pp. 298-310
• Approximation algorithms for the general max-min resource sharing problem: Faster and simpler
  Klaus Jansen
  Lecture Notes in Computer Science 3111, 2004, pp. 311-322
• Approximation schemes for the crane scheduling problem
  Andrew Lim, Brian Rodrigues, Zhou Xu
  Lecture Notes in Computer Science 3111, 2004, pp. 323-335
• Improved approximation algorithms for the single-sink buy-at-bulk network design problems
  Raja Jothi, Balaji Raghavachari
  Lecture Notes in Computer Science 3111, 2004, pp. 336-348
• A (2-c\frac{\log N}{N})-approximation algorithm for the stable marriage problem
  Kazuo Iwama, Shuichi Miyazaki, Kazuya Okamoto
  Lecture Notes in Computer Science 3111, 2004, pp. 349-361
• Maximizing the number of packed rectangles
  Klaus Jansen, Guochuan Zhang
  Lecture Notes in Computer Science 3111, 2004, pp. 362-371
• Two space saving tricks for linear time LCP array computation
  Giovanni Manzini
  Lecture Notes in Computer Science 3111, 2004, pp. 372-383
• Fully-dynamic all-pairs shortest paths: Faster and allowing negative cycles
  Mikkel Thorup
  Lecture Notes in Computer Science 3111, 2004, pp. 384-396
• Faster deterministic gossiping in directed ad hoc radio networks
  Leszek Ga̧sieniec, Tomasz Radzik, Qin Xin
  Lecture Notes in Computer Science 3111, 2004, pp. 397-407
• Online scheduling of splittable tasks in peer-to-peer networks
  Leah Epstein, Rob van Stee
  Lecture Notes in Computer Science 3111, 2004, pp. 408-419
• The optimal online algorithms for minimizing maximum lateness
  Patchrawat Uthaisombut
  Lecture Notes in Computer Science 3111, 2004, pp. 420-430
• Power assignment in radio networks with two power levels
  Paz Carmi, Matthew J. Katz
  Lecture Notes in Computer Science 3111, 2004, pp. 431-441
• Pointed binary encompassing trees
  Michael Hoffmann, Bettina Speckmann, Csaba D. Tóth
  Lecture Notes in Computer Science 3111, 2004, pp. 442-454
• On geometric structure of global roundings for graphs and range spaces
  Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi Tokuyama
  Lecture Notes in Computer Science 3111, 2004, pp. 455-467
• External connected components
  Jop F. Sibeyn
  Lecture Notes in Computer Science 3111, 2004, pp. 468-479
• Cache-oblivious data structures and algorithms for undirected breadth-first search and shortest paths
  Gerth Stlting Brodal, Rolf Fagerberg, Ulrich Meyer, Norbert Zeh
  Lecture Notes in Computer Science 3111, 2004, pp. 480-492
• Simplified external memory algorithms for planar DAGs
  Lars Arge, Laura Toma
  Lecture Notes in Computer Science 3111, 2004, pp. 493-503