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

• Colourful linear programming
  Imre Bárány, Shmuel Onn
  Lecture Notes in Computer Science 1084, 1996, pp. 1-15
• Test sets and inequalities for integer programs
  Rekha R. Thomas, Robert Weismantel
  Lecture Notes in Computer Science 1084, 1996, pp. 16-30
• An optimal, stable continued fraction algorithm for arbitrary dimension
  Carsten Rössner, Claus P. Schnorr
  Lecture Notes in Computer Science 1084, 1996, pp. 31-43
• Algorithms and extended formulations for one and two facility network design
  Sunil Chopra, Itzhak Gilboa, S. Trilochan Sastry
  Lecture Notes in Computer Science 1084, 1996, pp. 44-57
• Integer multicommodity flow problems
  Cynthia Barnhart, Christopher A. Hane, Pamela H. Vance
  Lecture Notes in Computer Science 1084, 1996, pp. 58-71
• A heuristic algorithm for the set covering problem
  Alberto Caprara, Matteo Fischetti, Paolo Toth
  Lecture Notes in Computer Science 1084, 1996, pp. 72-84
• An \epsilon-relaxation method for generalized separable convex cost network flow problems
  Paul Tseng, Dimitri P. Bertsekas
  Lecture Notes in Computer Science 1084, 1996, pp. 85-93
• Finding real-valued single-source shortest paths in o(n^3) expected time
  Stavros G. Kolliopoulos, Clifford Stein
  Lecture Notes in Computer Science 1084, 1996, pp. 94-104
• A network-flow technique for finding low-weight bounded-degree spanning trees
  Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal Young
  Lecture Notes in Computer Science 1084, 1996, pp. 105-117
• Approximating k-set cover and complementary graph coloring
  Magnús M. Halldórsson
  Lecture Notes in Computer Science 1084, 1996, pp. 118-131
• On minimum 3-cuts and approximating k-cuts using cut trees
  Sanjiv Kapoor
  Lecture Notes in Computer Science 1084, 1996, pp. 132-146
• Primal-dual approximation algorithms for feedback problems in planar graphs
  Michel X. Goemans, David P. Williamson
  Lecture Notes in Computer Science 1084, 1996, pp. 147-161
• Cone-LP's and semidefinite programs: Geometry and a simplex-type method
  Gábor Pataki
  Lecture Notes in Computer Science 1084, 1996, pp. 162-174
• Quadratic knapsack relaxations using cutting planes and semidefinite programming
  C. Helmberg, F. Rendl, R. Weismantel
  Lecture Notes in Computer Science 1084, 1996, pp. 175-189
• A semidefinite bound for mixing rates of Markov chains
  Nabil Kahale
  Lecture Notes in Computer Science 1084, 1996, pp. 190-203
• The quadratic assignment problem with a monotone anti-Monge and a symmetric Toeplitz matrix: Easy and hard cases
  Rainer E. Burkard, Eranda Çela, Günther Rote, Gerhard J. Woeginger
  Lecture Notes in Computer Science 1084, 1996, pp. 204-218
• On optimizing multiplications of sparse matrices
  Edith Cohen
  Lecture Notes in Computer Science 1084, 1996, pp. 219-233
• Continuous relaxations for constrained maximum-entropy sampling
  Kurt M. Anstreicher, Marcia Fampa, Jon Lee, Joy Williams
  Lecture Notes in Computer Science 1084, 1996, pp. 234-248
• A submodular optimization problem with side constraints
  David Hartvigsen
  Lecture Notes in Computer Science 1084, 1996, pp. 249-259
• Convexity and Steinitz's exchange property
  Kazuo Murota
  Lecture Notes in Computer Science 1084, 1996, pp. 260-274
• On ideal clutters, metrics and multiflows
  Beth Novick, András Sebŏ
  Lecture Notes in Computer Science 1084, 1996, pp. 275-287
• A supermodular relaxation for scheduling with release dates
  Michel Goemans X
  Lecture Notes in Computer Science 1084, 1996, pp. 288-300
• Scheduling to minimize total weighted completion time: Performance guarantees of LP-based heuristics and lower bounds
  Andreas S. Schulz
  Lecture Notes in Computer Science 1084, 1996, pp. 301-315
• Implementation of a linear time algorithm for certain generalized Traveling Salesman problems
  Neil Simonetti, Egon Balas
  Lecture Notes in Computer Science 1084, 1996, pp. 316-329
• On dependent randomized rounding algorithms
  Dimitris Bertsimas, Chung-Piaw Teo, Rakesh Vohra
  Lecture Notes in Computer Science 1084, 1996, pp. 330-344