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: Author="Shepherd, F. Bruce"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The all-or-nothing multicommodity flow problem
Chandra Chekuri
,
Sanjeev Khanna
,
F. Bruce Shepherd
SIAM Journal on Computing
42
(4), 2013, pp. 1467-1493
Maximum edge-disjoint paths in
k
-sums of graphs
Chandra Chekuri
,
Guyslain Naves
,
F. Bruce Shepherd
Lecture Notes in Computer Science
7965
, 2013, pp. 328-339
Flow-cut gaps for integer and fractional multiflows
Chandra Chekuri
,
F. Bruce Shepherd
,
Christophe Weibel
Journal of Combinatorial Theory Series B
103
(2), 2013, pp. 248-273
The VPN conjecture is true
Navin Goyal
,
Neil Olver
,
F. Bruce Shepherd
Journal of the ACM
60
(3), 2013, pp. 17: 1-17
Topology-aware VM migration in bandwidth oversubscribed datacenter networks
Navendu Jain
,
Ishai Menache
,
Joseph (Seffi) Naor
,
F. Bruce Shepherd
Lecture Notes in Computer Science
7392
, 2012, pp. 586-597
Dynamic vs. oblivious routing in network design
Navin Goyal
,
Neil Olver
,
F. Bruce Shepherd
Algorithmica
61
(1), 2011, pp. 161-173
A 3-approximation for facility location with uniform capacities
Ankit Aggarwal
,
L. Anand
,
Manisha Bansal
,
Naveen Garg
,
Neelima Gupta
,
Shubham Gupta
,
Surabhi Jain
Lecture Notes in Computer Science
6080
, 2010, pp. 149-162
Efficient deterministic algorithms for finding a minimum cycle basis in undirected graphs
Edoardo Amaldi
,
Claudio Iuliano
,
Romeo Rizzi
Lecture Notes in Computer Science
6080
, 2010, pp. 397-410
Zero-coefficient cuts
Kent Andersen
,
Robert Weismantel
Lecture Notes in Computer Science
6080
, 2010, pp. 57-70
On generalizations of network design problems with degree bounds
Nikhil Bansal
,
Rohit Khandekar
,
Jochen Könemann
,
Viswanath Nagarajan
,
Britta Peis
Lecture Notes in Computer Science
6080
, 2010, pp. 110-123
On
k
-column sparse packing programs
Nikhil Bansal
,
Nitish Korula
,
Viswanath Nagarajan
,
Aravind Srinivasan
Lecture Notes in Computer Science
6080
, 2010, pp. 369-382
On lifting integer variables in minimal inequalities
Amitabh Basu
,
Manoel Campelo
,
Michele Conforti
,
Gérard Cornuéjols
,
Giacomo Zambelli
Lecture Notes in Computer Science
6080
, 2010, pp. 85-95
Extending SDP integrality gaps to Sherali-Adams with applications to
Quadratic Programming
and
MaxCutGain
Siavosh Benabbas
,
Avner Magen
Lecture Notes in Computer Science
6080
, 2010, pp. 299-312
Restricted
b
-matchings in degree-bounded graphs
Kristóf Bérczi
,
László A. Végh
Lecture Notes in Computer Science
6080
, 2010, pp. 43-56
The price of collusion in series-parallel networks
Umang Bhaskar
,
Lisa Fleischer
,
Chien-Chung Huang
Lecture Notes in Computer Science
6080
, 2010, pp. 313-326
Solving LP relaxations of large-scale precedence constrained problems
Daniel Bienstock
,
Mark Zuckerberg
Lecture Notes in Computer Science
6080
, 2010, pp. 1-14
Eigenvalue techniques for convex objective, nonconvex optimization problems
Daniel Bienstock
Lecture Notes in Computer Science
6080
, 2010, pp. 29-42
Approximability of 3- and 4-hop bounded disjoint paths problems
Andreas Bley
,
Jose Neto
Lecture Notes in Computer Science
6080
, 2010, pp. 205-218
A pumping algorithm for ergodic stochastic mean payoff games with perfect information
Endre Boros
,
Khaled Elbassioni
,
Vladimir Gurvich
,
Kazuhisa Makino
Lecture Notes in Computer Science
6080
, 2010, pp. 341-354
Secretary problems via linear programming
Niv Buchbinder
,
Kamal Jain
,
Mohit Singh
Lecture Notes in Computer Science
6080
, 2010, pp. 163-176
An effective branch-and-bound algorithm for convex quadratic integer programming
Christoph Buchheim
,
Alberto Caprara
,
Andrea Lodi
Lecture Notes in Computer Science
6080
, 2010, pp. 285-298
Fault-tolerant facility location: A randomized dependent LP-rounding algorithm
Jaroslaw Byrka
,
Aravind Srinivasan
,
Chaitanya Swamy
Lecture Notes in Computer Science
6080
, 2010, pp. 244-257
On column-restricted and priority covering integer programs
Deeparnab Chakrabarty
,
Elyot Grant
,
Jochen Könemann
Lecture Notes in Computer Science
6080
, 2010, pp. 355-368
Hypergraphic LP relaxations for Steiner trees
Deeparnab Chakrabarty
,
Jochen Könemann
,
David Pritchard
Lecture Notes in Computer Science
6080
, 2010, pp. 383-396
Experiments with two row tableau cuts
Santanu S. Dey
,
Andrea Lodi
,
Andrea Tramontani
,
Laurence A. Wolsey
Lecture Notes in Computer Science
6080
, 2010, pp. 424-437
Seiten 1
2
>