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

• Power optimization for connectivity problems
  Mohammad T. Hajiaghayi, Guy Kortsarz, Vahab S. Mirrokni, Zeev Nutov
  Lecture Notes in Computer Science 3509, 2005, pp. 349-361
• Packing Steiner forests
  Lap Chi Lau
  Lecture Notes in Computer Science 3509, 2005, pp. 362-376
• Bidimensional packing by bilinear programming
  Alberto Caprara, Marco Locatelli, Michele Monaci
  Lecture Notes in Computer Science 3509, 2005, pp. 377-391
• On the L_\infty-norm of extreme points for crossing supermodular directed network LPs
  Harold N. Gabow
  Lecture Notes in Computer Science 3509, 2005, pp. 392-406
• Virtual private network design: A proof of the tree routing conjecture on ring networks
  C.A.J. Hurkens, J.C.M. Keijsper, L. Stougie
  Lecture Notes in Computer Science 3509, 2005, pp. 407-421
• Approximation algorithms for the minimum cardinality two-connected spanning subgraph problem
  Prabhakar Gubbala, Balaji Raghavachari
  Lecture Notes in Computer Science 3509, 2005, pp. 422-436
• Using grammars to generate very large scale neighborhoods for the Traveling Salesman Problem and other sequencing problems
  Agustin Bompadre, James B. Orlin
  Lecture Notes in Computer Science 3509, 2005, pp. 437-451
• A study of domino-parity and k-parity constraints for the TSP
  William Cook, Daniel Espinoza, Marcos Goycoolea
  Lecture Notes in Computer Science 3509, 2005, pp. 452-467
• Not every GTSP facet induces an STSP facet
  Marcus Oswald, Gerhard Reinelt, Dirk Oliver Theis
  Lecture Notes in Computer Science 3509, 2005, pp. 468-482