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

• Online packet switching
  Yossi Azar
  Lecture Notes in Computer Science 3351, 2005, pp. 1-5
• Approximation algorithms for mixed fractional packing and covering problems
  Klaus Jansen
  Lecture Notes in Computer Science 3351, 2005, pp. 6-8
• Minimum sum multicoloring on the edges of planar graphs and partial k-trees
  Dániel Marx
  Lecture Notes in Computer Science 3351, 2005, pp. 9-22
• Online bin packing with resource augmentation
  Leah Epstein, Rob van Stee
  Lecture Notes in Computer Science 3351, 2005, pp. 23-35
• A PTAS for delay minimization in establishing wireless conference calls
  Leah Epstein, Asaf Levin
  Lecture Notes in Computer Science 3351, 2005, pp. 36-47
• This side up!
  Leah Epstein, Rob van Stee
  Lecture Notes in Computer Science 3351, 2005, pp. 48-60
• Approximation algorithm for directed multicuts
  Yana Kortsarts, Guy Kortsarz, Zeev Nutov
  Lecture Notes in Computer Science 3351, 2005, pp. 61-67
• Improved bounds for sum multicoloring and scheduling dependent jobs with minsum criteria
  Rajiv Gandhi, Magnús M. Halldórsson, Guy Kortsarz, Hadas Shachnai
  Lecture Notes in Computer Science 3351, 2005, pp. 68-82
• Approximation algorithms for spreading points
  Sergio Cabello
  Lecture Notes in Computer Science 3351, 2005, pp. 83-96
• More powerful and simpler cost-sharing methods (When cross-monotonicity is the wrong way)
  Paolo Penna, Carmine Ventre
  Lecture Notes in Computer Science 3351, 2005, pp. 97-110
• Approximation schemes for deal splitting and covering integer programs with multiplicity constraints
  Hadas Shachnai, Oded Shmueli, Robert Sayegh
  Lecture Notes in Computer Science 3351, 2005, pp. 111-125
• Priority algorithms for graph optimization problems
  Allan Borodin, Joan Boyar, Kim S. Larsen
  Lecture Notes in Computer Science 3351, 2005, pp. 126-139
• Pricing network edges to cross a river
  Alexander Grigoriev, Stan van Hoesel, Anton F. van der Kraaij, Marc Uetz, Mustapha Bouhtou
  Lecture Notes in Computer Science 3351, 2005, pp. 140-153
• Submodular integer cover and its application to production planning
  Toshihiro Fujito, Takatoshi Yabuta
  Lecture Notes in Computer Science 3351, 2005, pp. 154-166
• Stochastic online scheduling on parallel machines
  Nicole Megow, Marc Uetz, Tjark Vredeveld
  Lecture Notes in Computer Science 3351, 2005, pp. 167-180
• A \frac 54-approximation algorithm for biconnecting a graph with a given Hamiltonian path
  Davide Bilò, Guido Proietti
  Lecture Notes in Computer Science 3351, 2005, pp. 181-196
• Order-preserving transformations and greedy-like algorithms
  Spyros Angelopoulos
  Lecture Notes in Computer Science 3351, 2005, pp. 197-210
• Off-line admission control for advance reservations in star networks
  Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl
  Lecture Notes in Computer Science 3351, 2005, pp. 211-224
• Joint base station scheduling
  Thomas Erlebach, Riko Jacob, Matús̑ Mihal̑ák, Marc Nunkesser, Gábor Szabó, Peter Widmayer
  Lecture Notes in Computer Science 3351, 2005, pp. 225-238
• Universal bufferless routing
  Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas
  Lecture Notes in Computer Science 3351, 2005, pp. 239-252
• Strong colorings of hypergraphs
  Geir Agnarsson, Magnús M. Halldórsson
  Lecture Notes in Computer Science 3351, 2005, pp. 253-266
• Deterministic monotone algorithms for scheduling on related machines
  Pasquale Ambrosio, Vincenzo Auletta
  Lecture Notes in Computer Science 3351, 2005, pp. 267-280
• Better bounds for minimizing SONET ADMs
  Leah Epstein, Asaf Levin
  Lecture Notes in Computer Science 3351, 2005, pp. 281-294