Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=2081

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

Two O(\log ^* k)-approximation algorithms for the asymmetric k-center problem
Aaron Archer
Lecture Notes in Computer Science 2081, 2001, pp. 1-14
Strongly polynomial algorithms for the unsplittable flow problem
Yossi Azar, Oded Regev
Lecture Notes in Computer Science 2081, 2001, pp. 15-29
Edge covers of setpairs and the iterative rounding method
Joseph Cheriyan, Santosh Vempala
Lecture Notes in Computer Science 2081, 2001, pp. 30-44
The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
Cheng-Feng Mabel Chou, Maurice Queyranne, David Simchi-Levi
Lecture Notes in Computer Science 2081, 2001, pp. 45-59
Approximate k-MSTs and k-Steiner trees via the primal-dual method and Lagrangean relaxation
Fabián A. Chudak, Tim Roughgarden, David P. Williamson
Lecture Notes in Computer Science 2081, 2001, pp. 60-70
On the rank of mixed 0,1 polyhedra
Gérard Cornuéjols, Yanjun Li
Lecture Notes in Computer Science 2081, 2001, pp. 71-77
Fast 2-variable integer programming
Friedrich Eisenbrand, Günter Rote
Lecture Notes in Computer Science 2081, 2001, pp. 78-89
Approximating k-spanner problems for k>2
Michael Elkin, David Peleg
Lecture Notes in Computer Science 2081, 2001, pp. 90-104
A matroid generalization of the stable matching polytope
Tamás Fleiner
Lecture Notes in Computer Science 2081, 2001, pp. 105-114
A 2-approximation for minimum cost 0,1,2 vertex connectivity
Lisa Fleischer
Lecture Notes in Computer Science 2081, 2001, pp. 115-129
Combined connectivity augmentation and orientation problems
András Frank, Tamás Király
Lecture Notes in Computer Science 2081, 2001, pp. 130-144
An extension of a theorem of Henneberg and Laman
András Frank, László Szegŏ
Lecture Notes in Computer Science 2081, 2001, pp. 145-159
Bisubmodular function minimization
Satoru Fujishige, Satoru Iwata
Lecture Notes in Computer Science 2081, 2001, pp. 160-169
On the integrality gap of a natural formulation of the single-sink buy-at-bulk network design problem
Naveen Garg, Rohit Khandekar, Goran Konjevod, R. Ravi, F.S. Salman, Amitabh Sinha
Lecture Notes in Computer Science 2081, 2001, pp. 170-184
Circuit Mengerian directed graphs
Bertrand Guenin
Lecture Notes in Computer Science 2081, 2001, pp. 185-195
Integral polyhedra related to even cycle and even cut matroids
Bertrand Guenin
Lecture Notes in Computer Science 2081, 2001, pp. 196-209
A unified framework for obtaining improved approximation algorithms for maximum graph bisection problems
Eran Halperin, Uri Zwick
Lecture Notes in Computer Science 2081, 2001, pp. 210-225
Synthesis of 2-commodity flow networks
Refael Hassin, Asaf Levin
Lecture Notes in Computer Science 2081, 2001, pp. 226-235
Bounds for deterministic periodic routing sequences
A. Hordijk, D.A. van der Laan
Lecture Notes in Computer Science 2081, 2001, pp. 236-250
Cutting planes for mixed 0-1 semidefinite programs
G. Iyengar, M.T. Çezik
Lecture Notes in Computer Science 2081, 2001, pp. 251-263
Independence free graphs and vertex connectivity augmentation
Bill Jackson, Tibor Jordán
Lecture Notes in Computer Science 2081, 2001, pp. 264-279
The throughput of sequential testing
Murali S. Kodialam
Lecture Notes in Computer Science 2081, 2001, pp. 280-292
An explicit exact SDP relaxation for nonlinear 0-1 programs
Jean B. Lasserre
Lecture Notes in Computer Science 2081, 2001, pp. 293-303
Pruning by isomorphism in branch-and-cut
François Margot
Lecture Notes in Computer Science 2081, 2001, pp. 304-317
Facets, algorithms, and polyhedral characterizations for a multi-item production planning model with setup times
Andrew J. Miller, George L. Nemhauser, Martin W.P. Savelsbergh
Lecture Notes in Computer Science 2081, 2001, pp. 318-332

Seiten 1 2 >