Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [1]	Hilfe

Suche: Series=LNCS AND Volume=1412

Als [bib] [pdf] [ps] [dvi] [xml] herunterladen.

The packing property
Gérard Cornuéjols, Bertrand Guenin, François Margot
Lecture Notes in Computer Science 1412, 1998, pp. 1-8
A characterization of weakly bipartite graphs
Bertrand Guenin
Lecture Notes in Computer Science 1412, 1998, pp. 9-22
Bipartite designs
Grigor Gasparyan
Lecture Notes in Computer Science 1412, 1998, pp. 23-36
Characterizing noninteger polyhedra with 0-1 constraints
András Sebŏ
Lecture Notes in Computer Science 1412, 1998, pp. 37-52
A theorem of Truemper
Michele Conforti, Ajai Kapoor
Lecture Notes in Computer Science 1412, 1998, pp. 53-68
The generalized stable set problem for claw-free bidirected graphs
Daishin Nakamura, Akihisa Tamura
Lecture Notes in Computer Science 1412, 1998, pp. 69-83
On a min-max theorem of cacti
Zoltán Szigeti
Lecture Notes in Computer Science 1412, 1998, pp. 84-95
Edge-splitting and edge-connectivity augmentation in planar graphs
Hiroshi Nagamochi, Peter Eades
Lecture Notes in Computer Science 1412, 1998, pp. 96-111
A new bound for the 2-edge connected subgraph problem
Robert Carr, R. Ravi
Lecture Notes in Computer Science 1412, 1998, pp. 112-125
An improved approximation algorithm for minimum size 2-edge connected spanning subgraphs
Joseph Cheriyan, András Sebŏ, Zoltán Szigeti
Lecture Notes in Computer Science 1412, 1998, pp. 126-136
Multicuts in unweighted graphs with bounded degree and bounded tree-width
Gruia Călinescu, Cristina G. Fernandes, Bruce Reed
Lecture Notes in Computer Science 1412, 1998, pp. 137-152
Approximating disjoint-path problems using greedy algorithms and packing integer programs
Stavros G. Kolliopoulos, Clifford Stein
Lecture Notes in Computer Science 1412, 1998, pp. 153-168
Approximation algorithms for the mixed postman problem
Balaji Raghavachari, Jeyakesavan Veerasamy
Lecture Notes in Computer Science 1412, 1998, pp. 169-179
Improved approximation algorithms for uncapacitated facility location
Fabián A. Chudak
Lecture Notes in Computer Science 1412, 1998, pp. 180-194
The maximum traveling salesman problem under polyhedral norms
Alexander Barvinok, David S. Johnson, Gerhard J. Woeginger, Russell Woodroofe
Lecture Notes in Computer Science 1412, 1998, pp. 195-201
Polyhedral combinatorics of benzenoid problems
Hernán Abeledo, Gary Atkinson
Lecture Notes in Computer Science 1412, 1998, pp. 202-212
Consecutive ones and a betweenness problem in computational biology
Thomas Christof, Marcus Oswald, Gerhard Reinelt
Lecture Notes in Computer Science 1412, 1998, pp. 213-228
Solving a linear diophantine equation with lower and upper bounds on the variables
Karen Aardal, Cor Hurkens, Arjen K. Lenstra
Lecture Notes in Computer Science 1412, 1998, pp. 229-242
The intersection of knapsack polyhedra and extensions
Alexander Martin, Robert Weismantel
Lecture Notes in Computer Science 1412, 1998, pp. 243-256
New classes of lower bounds for bin packing problems
Sándor P. Fekete, Jörg Schepers
Lecture Notes in Computer Science 1412, 1998, pp. 257-270
Solving integer and disjunctive programs by lift and project
Sebastián Ceria, Gábor Pataki
Lecture Notes in Computer Science 1412, 1998, pp. 271-283
A class of hard small 0-1 programs
Gérard Cornuéjols, Milind Dawande
Lecture Notes in Computer Science 1412, 1998, pp. 284-293
Building chain and cactus representations of all minimum cuts from Hao-Orlin in the same asymptotic run time
Lisa Fleischer
Lecture Notes in Computer Science 1412, 1998, pp. 294-309
Simple generalized maximum flow algorithms
Éva Tardos, Kevin D. Wayne
Lecture Notes in Computer Science 1412, 1998, pp. 310-324
The pseudoflow algorithm and the pseudoflow-based simplex for the maximum flow problem
Dorit S. Hochbaum
Lecture Notes in Computer Science 1412, 1998, pp. 325-337

Seiten 1 2 >