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

• Facial structure and representation of integer hulls of convex sets
  Vishnu Narayanan
  Lecture Notes in Computer Science 7801, 2013, pp. 302-313
• An efficient polynomial-time approximation scheme for the joint replenishment problem
  Tim Nonner, Maxim Sviridenko
  Lecture Notes in Computer Science 7801, 2013, pp. 314-323
• Chain-constrained spanning trees
  Neil Olver, Rico Zenklusen
  Lecture Notes in Computer Science 7801, 2013, pp. 324-335
• A simpler proof for O(\mbox{congestion} + \mbox{dilation}) packet routing
  Thomas Rothvoß
  Lecture Notes in Computer Science 7801, 2013, pp. 336-348
• 0/1 polytopes with quadratic Chvátal rank
  Thomas Rothvoß, Laura Sanità
  Lecture Notes in Computer Science 7801, 2013, pp. 349-361
• Eight-fifth approximation for the path TSP
  András Sebŏ
  Lecture Notes in Computer Science 7801, 2013, pp. 362-374
• Fast deterministic algorithms for matrix completion problems
  Tasuku Soma
  Lecture Notes in Computer Science 7801, 2013, pp. 375-386
• Approximating the configuration-LP for minimizing weighted sum of completion times on unrelated machines
  Maxim Sviridenko, Andreas Wiese
  Lecture Notes in Computer Science 7801, 2013, pp. 387-398