Die bibliographische Datenbank LEABib

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

Suche: Series=LNCS AND Volume=1610

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

Market split and basis reduction: Towards a solution of the Cornuéjols-Dawande instances
Karen Aardal, Robert E. Bixby, Cor A.J. Hurkens, Arjen K. Lenstra, Job W. Smeltink
Lecture Notes in Computer Science 1610, 1999, pp. 1-16
Approximation algorithms for maximum coverage and max cut with given sizes of parts
Alexander A. Ageev, Maxim I. Sviridenko
Lecture Notes in Computer Science 1610, 1999, pp. 17-30
Solving the convex cost integer dual network flow problem
Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin
Lecture Notes in Computer Science 1610, 1999, pp. 31-44
Some structural and algorithmic properties of the maximum feasible subsystem problem
Edoardo Amaldi, Marc E. Pfetsch, Leslie E., Jr. Trotter
Lecture Notes in Computer Science 1610, 1999, pp. 45-59
Valid inequalities for problems with additive variable upper bounds
Alper Atamtürk, George L. Nemhauser, Martin W.P. Savelsbergh
Lecture Notes in Computer Science 1610, 1999, pp. 60-72
A min-max theorem on feedback vertex sets
Mao-cheng Cai, Xiaotie Deng, Wenan Zang
Lecture Notes in Computer Science 1610, 1999, pp. 73-86
On the separation of maximally violated mod-k cuts
Alberto Caprara, Matteo Fischetti, Adam N. Letchford
Lecture Notes in Computer Science 1610, 1999, pp. 87-98
Improved approximation algorithms for capacitated facility location problems
Fabián A. Chudak, David P. Williamson
Lecture Notes in Computer Science 1610, 1999, pp. 99-113
Optimal 3-terminal cuts and linear programming
William H. Cunningham, Lawrence Tang
Lecture Notes in Computer Science 1610, 1999, pp. 114-125
Semidefinite programming methods for the symmetric Traveling Salesman problem
Dragos̑ Cvetković, Mirjana C̑angalović, Vera Kovac̑ević-Vujc̑ić
Lecture Notes in Computer Science 1610, 1999, pp. 126-136
Bounds on the Chvátal rank of polytopes in the 0/1-cube
Friedrich Eisenbrand, Andreas S. Schulz
Lecture Notes in Computer Science 1610, 1999, pp. 137-150
Universally maximum flow with piecewise-constant capacities
Lisa Fleischer
Lecture Notes in Computer Science 1610, 1999, pp. 151-165
Critical extreme points of the 2-edge connected spanning subgraph polytope
Jean Fonlupt, Ali Ridha Mahjoub
Lecture Notes in Computer Science 1610, 1999, pp. 166-182
An orientation theorem with parity conditions
András Frank, Tibor Jordán, Zoltán Szigeti
Lecture Notes in Computer Science 1610, 1999, pp. 183-190
Parity constrained k-edge-connected orientations
András Frank, Zoltán Király
Lecture Notes in Computer Science 1610, 1999, pp. 191-201
Approximation algorithms for MAX 4-SAT and rounding procedures for semidefinite programs
Eran Halperin, Uri Zwick
Lecture Notes in Computer Science 1610, 1999, pp. 202-217
On the Chvátal rank of certain inequalities
Mark Hartmann, Maurice Queyranne, Yaoguang Wang
Lecture Notes in Computer Science 1610, 1999, pp. 218-233
The square-free 2-factor problem in bipartite graphs
David Hartvigsen
Lecture Notes in Computer Science 1610, 1999, pp. 234-241
The m-cost ATSP
Christoph Helmberg
Lecture Notes in Computer Science 1610, 1999, pp. 242-258
A strongly polynomial cut canceling algorithm for the submodular flow problem
Satoru Iwata, S. Thomas McCormick, Maiko Shigeno
Lecture Notes in Computer Science 1610, 1999, pp. 259-272
Edge-splitting problems with demands
Tibor Jordán
Lecture Notes in Computer Science 1610, 1999, pp. 273-288
Integral polyhedra associated with certain submodular functions defined on 012-vectors
Kenji Kashiwabara, Masataka Nakamura, Takashi Takabatake
Lecture Notes in Computer Science 1610, 1999, pp. 289-303
Optimal compaction of orthogonal grid drawings
Gunnar W. Klau, Petra Mutzel
Lecture Notes in Computer Science 1610, 1999, pp. 304-319
On the number of iterations for Dantzig-Wolfe optimization and packing-covering approximation algorithms
Philip Klein, Neal Young
Lecture Notes in Computer Science 1610, 1999, pp. 320-327
Experimental evaluation of approximation algorithms for single-source unsplittable flow
Stavros G. Kolliopoulos, Clifford Stein
Lecture Notes in Computer Science 1610, 1999, pp. 328-344

Seiten 1 2 >