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

• A primal-dual algorithm for weighted abstract cut packing
  S. Thomas McCormick, Britta Peis
  Lecture Notes in Computer Science 6655, 2011, pp. 324-335
• Convexification techniques for linear complementarity constraints
  Trang T. Nguyen, Mohit Tawarmalani, Jean-Philippe P. Richard
  Lecture Notes in Computer Science 6655, 2011, pp. 336-348
• Iterative packing for demand and hypergraph matching
  Ojas Parekh
  Lecture Notes in Computer Science 6655, 2011, pp. 349-361
• Universal packet routing with arbitrary bandwidths and transit times
  Britta Peis, Andreas Wiese
  Lecture Notes in Computer Science 6655, 2011, pp. 362-375
• A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems
  Mario Ruthmair, Günther R. Raidl
  Lecture Notes in Computer Science 6655, 2011, pp. 376-388
• Jump number of two-directional orthogonal ray graphs
  José A. Soto, Claudio Telha
  Lecture Notes in Computer Science 6655, 2011, pp. 389-403
• Optimal matching forests and valuated delta-matroids
  Kenjiro Takazawa
  Lecture Notes in Computer Science 6655, 2011, pp. 404-416
• Fixed-charge transportation on a path: Linear programming formulations
  Mathieu Van Vyve
  Lecture Notes in Computer Science 6655, 2011, pp. 417-429