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

• Mixed-integer cuts from cyclic groups
  Matteo Fischetti, Cristiano Saturni
  Lecture Notes in Computer Science 3509, 2005, pp. 1-11
• Optimizing over the first Chvàtal closure
  Matteo Fischetti, Andrea Lodi
  Lecture Notes in Computer Science 3509, 2005, pp. 12-22
• Sequential pairing of mixed integer inequalities
  Yongpei Guan, Shabbir Ahmed, George L. Nemhauser
  Lecture Notes in Computer Science 3509, 2005, pp. 23-34
• Approximate min-max relations for odd cycles in planar graphs
  Samuel Fiorini, Nadia Hardy, Bruce Reed, Adrian Vetta
  Lecture Notes in Computer Science 3509, 2005, pp. 35-50
• Disjoint cycles: Integrality gap, hardness, and approximation
  Mohammad R. Salavatipour, Jacques Verstraete
  Lecture Notes in Computer Science 3509, 2005, pp. 51-65
• A combinatorial algorithm to find a maximum even factor
  Gyula Pap
  Lecture Notes in Computer Science 3509, 2005, pp. 66-80
• Improved approximation schemes for linear programming relaxations of combinatorial optimization problems
  Fabián A. Chudak, Vânia Eleutério
  Lecture Notes in Computer Science 3509, 2005, pp. 81-96
• On the approximability of the minimum congestion unsplittable shortest path routing problem
  Andreas Bley
  Lecture Notes in Computer Science 3509, 2005, pp. 97-110
• Inventory and facility location models with market selection
  Retsef Levi, Joseph Geunes, H. Edwin Romeijn, David B. Shmoys
  Lecture Notes in Computer Science 3509, 2005, pp. 111-124
• On approximating complex quadratic optimization problems via semidefinite programming relaxations
  Anthony Man-Cho So, Jiawei Zhang, Yinyu Ye
  Lecture Notes in Computer Science 3509, 2005, pp. 125-135
• Semidefinite bounds for the stability number of a graph via sums of squares of polynomials
  Nebojs̑a Gvozdenović, Monique Laurent
  Lecture Notes in Computer Science 3509, 2005, pp. 136-151
• Approximation algorithms for semidefinite packing problems with applications to MAXCUT and graph coloring
  G. Iyengar, D.J. Phillips, C. Stein
  Lecture Notes in Computer Science 3509, 2005, pp. 152-166
• On the inefficiency of equilibria in congestion games
  José R. Correa, Andreas S. Schulz, Nicolás E. Stier-Moses
  Lecture Notes in Computer Science 3509, 2005, pp. 167-181
• Unrelated parallel machine scheduling with resource dependent processing times
  Alexander Grigoriev, Maxim Sviridenko, Marc Uetz
  Lecture Notes in Computer Science 3509, 2005, pp. 182-195
• LP-based online scheduling: From single to parallel machines
  José R. Correa, Michael R. Wagner
  Lecture Notes in Computer Science 3509, 2005, pp. 196-209
• Unique sink orientations of grids
  Bernd Gärtner, Walter D. Morris, Leo Rüst
  Lecture Notes in Computer Science 3509, 2005, pp. 210-224
• Jumping doesn't help in abstract cubes
  Ingo Schurr, Tibor Szabó
  Lecture Notes in Computer Science 3509, 2005, pp. 225-235
• Computing the inertia from sign patterns
  Naonori Kakimura, Satoru Iwata
  Lecture Notes in Computer Science 3509, 2005, pp. 236-248
• Randomized relaxation methods for the maximum feasible subsystem problem
  Edoardo Amaldi, Pietro Belotti, Raphael Hauser
  Lecture Notes in Computer Science 3509, 2005, pp. 249-264
• On clique separators, nearly chordal graphs, and the maximum Weight Stable Set Problem
  Andreas Brandstädt, Chính T. Hoàng
  Lecture Notes in Computer Science 3509, 2005, pp. 265-275
• Smoothed analysis of integer programming
  Heiko Röglin, Berthold Vöcking
  Lecture Notes in Computer Science 3509, 2005, pp. 276-290
• Circular ones matrices and the stable set polytope of quasi-line graphs
  Friedrich Eisenbrand, Gianpaolo Oriolo, Gautier Stauffer, Paolo Ventura
  Lecture Notes in Computer Science 3509, 2005, pp. 291-305
• Approximation algorithms for stochastic inventory control models
  Retsef Levi, Martin Pál, Robin Roundy, David B. Shmoys
  Lecture Notes in Computer Science 3509, 2005, pp. 306-320
• On two-stage stochastic minimum spanning trees
  Kedar Dhamdhere, R. Ravi, Mohit Singh
  Lecture Notes in Computer Science 3509, 2005, pp. 321-334
• Combinatorial analysis of generic matrix pencils
  Satoru Iwata, Ryo Shimizu
  Lecture Notes in Computer Science 3509, 2005, pp. 335-348