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

• On the structure of reduced kernel lattice bases
  Karen Aardal, Frederik von Heymann
  Lecture Notes in Computer Science 7801, 2013, pp. 1-12
• All-or-nothing generalized assignment with application to scheduling advertising campaigns
  Ron Adany, Moran Feldman, Elad Haramaty, Rohit Khandekar, Baruch Schieber, Roy Schwartz, Hadas Shachnai, Tami Tamir
  Lecture Notes in Computer Science 7801, 2013, pp. 13-24
• Constant integrality gap LP formulations of unsplittable flow on a path
  Aris Anagnostopoulos, Fabrizio Grandoni, Stefano Leonardi, Andreas Wiese
  Lecture Notes in Computer Science 7801, 2013, pp. 25-36
• Intersection cuts for mixed integer conic quadratic sets
  Kent Andersen, Anders Nedergaard Jensen
  Lecture Notes in Computer Science 7801, 2013, pp. 37-48
• Content placement via the exponential potential function method
  David Applegate, Aaron Archer, Vijay Gopalakrishnan, Seungjoon Lee, K.K. Ramakrishnan
  Lecture Notes in Computer Science 7801, 2013, pp. 49-61
• Equivariant perturbation in Gomory and Johnson's infinite group problem: II. The unimodular two-dimensional case
  Amitabh Basu, Robert Hildebrand, Matthias Köppe
  Lecture Notes in Computer Science 7801, 2013, pp. 62-73
• Blocking optimal arborescences
  Attila Bernáth, Gyula Pap
  Lecture Notes in Computer Science 7801, 2013, pp. 74-85
• Minimum clique cover in claw-free perfect graphs and the weak Edmonds-Johnson property
  Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels, Gautier Stauffer
  Lecture Notes in Computer Science 7801, 2013, pp. 86-97
• A complexity and approximability study of the bilevel knapsack problem
  Alberto Caprara, Margarida Carvalho, Andrea Lodi, Gerhard J. Woeginger
  Lecture Notes in Computer Science 7801, 2013, pp. 98-109
• Matroid and knapsack center problems
  Danny Z. Chen, Jian Li, Hongyu Liang, Haitao Wang
  Lecture Notes in Computer Science 7801, 2013, pp. 110-122
• Cut-generating functions
  Michele Conforti, Gérard Cornuéjols, Aris Daniilidis, Claude Lemaréchal, Jérôme Malick
  Lecture Notes in Computer Science 7801, 2013, pp. 123-132
• Reverse Chvátal-Gomory rank
  Michele Conforti, Alberto Del Pia, Marco Di Summa, Yuri Faenza, Roland Grappe
  Lecture Notes in Computer Science 7801, 2013, pp. 133-144
• On some generalizations of the split closure
  Sanjeeb Dash, Oktay Günlük, Diego Alejandro Móran Ramirez
  Lecture Notes in Computer Science 7801, 2013, pp. 145-156
• Packing interdiction and partial covering problems
  Michael Dinitz, Anupam Gupta
  Lecture Notes in Computer Science 7801, 2013, pp. 157-168
• On valid inequalities for quadratic programming with continuous variables and binary indicators
  Hongbo Dong, Jeff Linderoth
  Lecture Notes in Computer Science 7801, 2013, pp. 169-180
• An improved integrality gap for asymmetric TSP paths
  Zachary Friggstad, Anupam Gupta, Mohit Singh
  Lecture Notes in Computer Science 7801, 2013, pp. 181-192
• Single commodity-flow algorithms for lifts of graphic and co-graphic matroids
  Bertrand Guenin, Leanne Stuive
  Lecture Notes in Computer Science 7801, 2013, pp. 193-204
• A stochastic probing problem with applications
  Anupam Gupta, Viswanath Nagarajan
  Lecture Notes in Computer Science 7801, 2013, pp. 205-216
• Thrifty algorithms for multistage robust optimization
  Anupam Gupta, Viswanath Nagarajan, Vijay V. Vazirani
  Lecture Notes in Computer Science 7801, 2013, pp. 217-228
• Shallow-light Steiner arborescences with vertex delays
  Stephan Held, Daniel Rotter
  Lecture Notes in Computer Science 7801, 2013, pp. 229-241
• Two dimensional optimal mechanism design for a sequencing problem
  Ruben Hoeksma, Marc Uetz
  Lecture Notes in Computer Science 7801, 2013, pp. 242-253
• Advances on matroid secretary problems: Free order model and laminar case
  Patrick Jaillet, José A. Soto, Rico Zenklusen
  Lecture Notes in Computer Science 7801, 2013, pp. 254-265
• A polynomial-time algorithm to check closedness of simple second order mixed-integer sets
  Diego Alejandro Morán Ramírez, Santanu S. Dey
  Lecture Notes in Computer Science 7801, 2013, pp. 266-277
• The complexity of scheduling for p-norms of flow and stretch
  Benjamin Moseley, Kirk Pruhs, Cliff Stein
  Lecture Notes in Computer Science 7801, 2013, pp. 278-289
• The euclidean k-supplier problem
  Viswanath Nagarajan, Baruch Schieber, Hadas Shachnau
  Lecture Notes in Computer Science 7801, 2013, pp. 290-301