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: Author="Cunningham, William H."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An algorithm for packing non-zero
A
-paths in group-labelled graphs
Maria Chudnovsky
,
William H. Cunningham
,
Jim Geelen
Combinatorica
28
(2), 2008, pp. 145-161
On integer programming and the branch-width of the constraint matrix
William H. Cunningham
,
Jim Geelen
Lecture Notes in Computer Science
4513
, 2007, pp. 158-166
Optimal 3-terminal cuts and linear programming
William H. Cunningham
,
Lawrence Tang
Lecture Notes in Computer Science
1610
, 1999, pp. 114-125
The optimal path-matching problem
William H. Cunningham
,
James F. Geelen
Combinatorica
17
(3), 1997, pp. 315-337
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
Colourful linear programming
Imre Bárány
,
Shmuel Onn
Lecture Notes in Computer Science
1084
, 1996, pp. 1-15
Integer multicommodity flow problems
Cynthia Barnhart
,
Christopher A. Hane
,
Pamela H. Vance
Lecture Notes in Computer Science
1084
, 1996, pp. 58-71
On dependent randomized rounding algorithms
Dimitris Bertsimas
,
Chung-Piaw Teo
,
Rakesh Vohra
Lecture Notes in Computer Science
1084
, 1996, pp. 330-344
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
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
A heuristic algorithm for the set covering problem
Alberto Caprara
,
Matteo Fischetti
,
Paolo Toth
Lecture Notes in Computer Science
1084
, 1996, pp. 72-84
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
Coloring bipartite hypergraphs
Hui Chen
,
Alan Frieze
Lecture Notes in Computer Science
1084
, 1996, pp. 345-358
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
On optimizing multiplications of sparse matrices
Edith Cohen
Lecture Notes in Computer Science
1084
, 1996, pp. 219-233
The optimal path-matching problem
William H. Cunningham
,
James F. Geelen
Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, FOCS'96 (Burlington, Vermont, October 14-16, 1996)
, 1996, pp. 78-85
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
Separating maximally violated comb inequalities in planar graphs
Lisa Fleischer
,
Éva Tardos
Lecture Notes in Computer Science
1084
, 1996, pp. 475-489
A polyhedral approach to the feedback vertex set problem
Meinrad Funke
,
Gerhard Reinelt
Lecture Notes in Computer Science
1084
, 1996, pp. 445-459
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
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
A supermodular relaxation for scheduling with release dates
Michel Goemans X
Lecture Notes in Computer Science
1084
, 1996, pp. 288-300
Approximating
k
-set cover and complementary graph coloring
Magnús M. Halldórsson
Lecture Notes in Computer Science
1084
, 1996, pp. 118-131
A submodular optimization problem with side constraints
David Hartvigsen
Lecture Notes in Computer Science
1084
, 1996, pp. 249-259
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
Seiten 1
2
3
>