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

• A faster scaling algorithm for minimizing submodular functions
  Satoru Iwata
  Lecture Notes in Computer Science 2337, 2002, pp. 1-8
• A generalization of Edmonds' matching and matroid intersection algorithms
  Bianca Spille, Robert Weismantel
  Lecture Notes in Computer Science 2337, 2002, pp. 9-20
• A coordinatewise domain scaling algorithm for M-convex function minimization
  Akihisa Tamura
  Lecture Notes in Computer Science 2337, 2002, pp. 21-35
• The quickest multicommodity flow problem
  Lisa Fleischer, Martin Skutella
  Lecture Notes in Computer Science 2337, 2002, pp. 36-53
• A new min-cut max-flow ratio for multicommodity flows
  Oktay Günlük
  Lecture Notes in Computer Science 2337, 2002, pp. 54-66
• Improved rounding techniques for the MAX 2-SAT and MAX DI-CUT problems
  Michael Lewin, Dror Livnat, Uri Zwick
  Lecture Notes in Computer Science 2337, 2002, pp. 67-82
• Finding the exact integrality gap for small Traveling Salesman Problems
  Sylvia Boyd, Geneviève Labonté
  Lecture Notes in Computer Science 2337, 2002, pp. 83-92
• Polynomial-time separation of simple comb inequalities
  Adam N. Letchford, Andrea Lodi
  Lecture Notes in Computer Science 2337, 2002, pp. 93-108
• A new approach to cactus construction applied to TSP support graphs
  Klaus M. Wenger
  Lecture Notes in Computer Science 2337, 2002, pp. 109-126
• Split closure and intersection cuts
  Kent Andersen, Gérard Cornuéjols, Yanjun Li
  Lecture Notes in Computer Science 2337, 2002, pp. 127-144
• An exponential lower bound on the length of some classes of branch-and-cut proofs
  Sanjeeb Dash
  Lecture Notes in Computer Science 2337, 2002, pp. 145-160
• Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
  Jean-Philippe P. Richard, Ismael R., Jr. de Farias, George L. Nemhauser
  Lecture Notes in Computer Science 2337, 2002, pp. 161-175
• On a lemma of Scarf
  Ron Aharoni, Tamás Fleiner
  Lecture Notes in Computer Science 2337, 2002, pp. 176-187
• A short proof of Seymour's characterization of the matroids with the Max-Flow Min-Cut property
  Bertrand Guenin
  Lecture Notes in Computer Science 2337, 2002, pp. 188-193
• Integer programming and Arrovian Social Welfare Functions
  Jay Sethuraman, Chung-Piaw Teo, Rakesh V. Vohra
  Lecture Notes in Computer Science 2337, 2002, pp. 194-211
• Integrated logistics: Approximation algorithms combining facility location and network design
  Ramamoorthi Ravi, Amitabh Sinha
  Lecture Notes in Computer Science 2337, 2002, pp. 212-229
• The minimum latency problem is NP-hard for weighted trees
  René Sitters
  Lecture Notes in Computer Science 2337, 2002, pp. 230-239
• An improved approximation algorithm for the metric uncapacitated facility location problem
  Maxim Sviridenko
  Lecture Notes in Computer Science 2337, 2002, pp. 240-257
• A polyhedral approach to surface reconstruction from planar contours
  Ernst Althaus, Christian Fink
  Lecture Notes in Computer Science 2337, 2002, pp. 258-272
• The semidefinite relaxation of the k-partition polytope is strong
  Andreas Eisenblätter
  Lecture Notes in Computer Science 2337, 2002, pp. 273-290
• A polyhedral study of the cardinality constrained knapsack problem
  Ismael R., Jr. de Farias, George L. Nemhauser
  Lecture Notes in Computer Science 2337, 2002, pp. 291-303
• A PTAS for minimizing total completion time of bounded batch scheduling
  Mao-Cheng Cai, Xiaotie Deng, Haodi Feng, Guojun Li, Guizhen Liu
  Lecture Notes in Computer Science 2337, 2002, pp. 304-314
• An approximation scheme for the two-stage, Two-Dimensional Bin Packing problem
  Alberto Caprara, Andrea Lodi, Michele Monaci
  Lecture Notes in Computer Science 2337, 2002, pp. 315-328
• On preemptive resource constrained scheduling: Polynomial-time approximation schemes
  Klaus Jansen, Lorant Porkolab
  Lecture Notes in Computer Science 2337, 2002, pp. 329-349
• Hard equality constrained integer knapsacks
  Karen Aardal, Arjen K. Lenstra
  Lecture Notes in Computer Science 2337, 2002, pp. 350-366