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

• A pumping algorithm for ergodic stochastic mean payoff games with perfect information
  Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Kazuhisa Makino
  Lecture Notes in Computer Science 6080, 2010, pp. 341-354
• On column-restricted and priority covering integer programs
  Deeparnab Chakrabarty, Elyot Grant, Jochen Könemann
  Lecture Notes in Computer Science 6080, 2010, pp. 355-368
• On k-column sparse packing programs
  Nikhil Bansal, Nitish Korula, Viswanath Nagarajan, Aravind Srinivasan
  Lecture Notes in Computer Science 6080, 2010, pp. 369-382
• Hypergraphic LP relaxations for Steiner trees
  Deeparnab Chakrabarty, Jochen Könemann, David Pritchard
  Lecture Notes in Computer Science 6080, 2010, pp. 383-396
• Efficient deterministic algorithms for finding a minimum cycle basis in undirected graphs
  Edoardo Amaldi, Claudio Iuliano, Romeo Rizzi
  Lecture Notes in Computer Science 6080, 2010, pp. 397-410
• Efficient algorithms for average completion time scheduling
  René Sitters
  Lecture Notes in Computer Science 6080, 2010, pp. 411-423
• Experiments with two row tableau cuts
  Santanu S. Dey, Andrea Lodi, Andrea Tramontani, Laurence A. Wolsey
  Lecture Notes in Computer Science 6080, 2010, pp. 424-437
• An OPT+1 algorithm for the cutting stock problem with constant number of object lengths
  Klaus Jansen, Roberto Solis-Oba
  Lecture Notes in Computer Science 6080, 2010, pp. 438-449
• On the rank of cutting-plane proof systems
  Sebastian Pokutta, Andreas S. Schulz
  Lecture Notes in Computer Science 6080, 2010, pp. 450-463