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 [1]	Hilfe

Suche: Series=LNCS AND Volume=1084

• Coloring bipartite hypergraphs
  Hui Chen, Alan Frieze
  Lecture Notes in Computer Science 1084, 1996, pp. 345-358
• Improved randomized approximation algorithms for lot-sizing problems
  Chung-Piaw Teo, Dimitris Bertsimas
  Lecture Notes in Computer Science 1084, 1996, pp. 359-373
• Minimizing total completion time in a two-machine flowshop: Analysis of special cases
  Han Hoogeveen, Tsuyoshi Kawaguchi
  Lecture Notes in Computer Science 1084, 1996, pp. 374-388
• A new approach to computing optimal schedules for the job-shop scheduling problem
  Paul Martin, David B. Shmoys
  Lecture Notes in Computer Science 1084, 1996, pp. 389-403
• Optimal on-line algorithms for single-machine scheduling
  J.A. Hoogeveen, A.P.A. Vestjens
  Lecture Notes in Computer Science 1084, 1996, pp. 404-414
• The strongest facets of the acyclic subgraph polytope are unknown
  Michel X. Goemans, Leslie A. Hall
  Lecture Notes in Computer Science 1084, 1996, pp. 415-429
• Transitive packing
  Rudolf Müller, Andreas S. Schulz
  Lecture Notes in Computer Science 1084, 1996, pp. 430-444
• A polyhedral approach to the feedback vertex set problem
  Meinrad Funke, Gerhard Reinelt
  Lecture Notes in Computer Science 1084, 1996, pp. 445-459
• Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time
  Robert Carr
  Lecture Notes in Computer Science 1084, 1996, pp. 460-474
• Separating maximally violated comb inequalities in planar graphs
  Lisa Fleischer, Éva Tardos
  Lecture Notes in Computer Science 1084, 1996, pp. 475-489
• The Travelling Salesman and the PQ-tree
  Rainer E. Burkard, Vladimir G. Deĭneko, Gerhard J. Woeginger
  Lecture Notes in Computer Science 1084, 1996, pp. 490-504