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

• Improved approximation algorithms for MAX k-CUT and MAX BISECTION
  Alan Frieze, Mark Jerrum
  Lecture Notes in Computer Science 920, 1995, pp. 1-13
• Approximating minimum feedback sets and multi-cuts in directed graphs
  Guy Even, Joseph (Seffi) Naor, Baruch Schieber, Madhu Sudan
  Lecture Notes in Computer Science 920, 1995, pp. 14-28
• Nonlinear formulations and improved randomized approximation algorithms for multicut problems
  Dimitris Bertsimas, Chungpiaw Teo, Rakesh Vohra
  Lecture Notes in Computer Science 920, 1995, pp. 29-39
• Separating clique tree and bipartition inequalities in polynomial time
  Robert D. Carr
  Lecture Notes in Computer Science 920, 1995, pp. 40-49
• The interval order polytope of a digraph
  Rudolf Müller, Andreas S. Schulz
  Lecture Notes in Computer Science 920, 1995, pp. 50-64
• Separation problems for the stable set polytope
  Eddie Cheng, William H. Cunningham
  Lecture Notes in Computer Science 920, 1995, pp. 65-79
• Computational study of a family of mixed-integer quadratic programming problems
  Daniel Bienstock
  Lecture Notes in Computer Science 920, 1995, pp. 80-94
• A minimal algorithm for the bounded Knapsack problem
  David Pisinger
  Lecture Notes in Computer Science 920, 1995, pp. 95-109
• A framework for tightening 0-1 programs based on extensions of pure 0-1 KP and SS problems
  L.F. Escudero, S. Martello, P. Toth
  Lecture Notes in Computer Science 920, 1995, pp. 110-123
• Combining semidefinite and polyhedral relaxations for integer programs
  C. Helmberg, S. Poljak, F. Rendl, H. Wolkowicz
  Lecture Notes in Computer Science 920, 1995, pp. 124-134
• Distributed near-optimal matching
  Xiatie Deng
  Lecture Notes in Computer Science 920, 1995, pp. 135-144
• The random linear bottleneck assignment problem
  Ulrich Pferschy
  Lecture Notes in Computer Science 920, 1995, pp. 145-156
• On implementing push-relabel method for the maximum flow problem
  Boris V. Cherkassky, Andrew V. Goldberg
  Lecture Notes in Computer Science 920, 1995, pp. 157-171
• Use of hidden network structure in the set partitioning problem
  Agha Iqbal Ali, Hyun-Soo Han, Jeffery L. Kennington
  Lecture Notes in Computer Science 920, 1995, pp. 172-184
• Generalized max flows and augmenting paths
  David Hartvigsen
  Lecture Notes in Computer Science 920, 1995, pp. 185-197
• Oriented matroid polytopes and polyhedral fans are signable
  Peter Kleinschmidt, Shmuel Onn
  Lecture Notes in Computer Science 920, 1995, pp. 198-211
• On combinatorial properties of binary spaces
  Beth Novick, András Sebö
  Lecture Notes in Computer Science 920, 1995, pp. 212-227
• Coverings and delta-coverings
  André Bouchet
  Lecture Notes in Computer Science 920, 1995, pp. 228-243
• The topological structure of maximal lattice free convex bodies: The general case
  I. Bárány, H.E. Scarf, D. Shallcross
  Lecture Notes in Computer Science 920, 1995, pp. 244-251
• The Hilbert basis of the cut cone over the complete graph K_6
  François Laburthe
  Lecture Notes in Computer Science 920, 1995, pp. 252-266
• GRIN: An implementation of Gröbner bases for integer programming
  Serkan Hoşten, Bernd Sturmfels
  Lecture Notes in Computer Science 920, 1995, pp. 267-276
• Scheduling jobs of equal length: Complexity, facets and computational results
  Yves Crama, Frits C.R. Spieksma
  Lecture Notes in Computer Science 920, 1995, pp. 277-291
• Formulating a scheduling problem with almost identical jobs by using positional completion times
  Han Hoogeveen, Steef van de Velde
  Lecture Notes in Computer Science 920, 1995, pp. 292-306
• Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
  Maurice Queyranne, Andreas S. Schulz
  Lecture Notes in Computer Science 920, 1995, pp. 307-320
• A Mickey-Mouse decomposition theorem
  Michele Conforti, Gérard Cornuéjols, Ajai Kapoor, Kristina Vus̑ković
  Lecture Notes in Computer Science 920, 1995, pp. 321-328