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, Bruce"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tight bounds for online vector bin packing
Yossi Azar
,
Ilan Reuven Cohen
,
Seny Kamara
,
Bruce Shepherd
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 961-970
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
Venkatesan Guruswami
,
Sanjeev Khanna
,
Rajmohan Rajaraman
,
Bruce Shepherd
,
Mihalis Yannakakis
Journal of Computer and System Sciences
67
(3), 2003, pp. 473-496
The demand matching problem
Bruce Shepherd
,
Adrian Vetta
Lecture Notes in Computer Science
2337
, 2002, pp. 457-474
A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
Bruce Shepherd
,
Lisa Zhang
Discrete Applied Mathematics
110
(2-3), 2001, pp. 301-315
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
Venkatesan Guruswami
,
Sanjeev Khanna
,
Rajmohan Rajaraman
,
Bruce Shepherd
,
Mihalis Yannakakis
Proceedings of the 31st Annual ACM Symposium on Theory of Computing, STOC'99 (Atlanta, Georgia, May 1-4, 1999)
, 1999, pp. 19-28
Domination in graphs with minimum degree two
William McCuaig
,
Bruce Shepherd
Journal of Graph Theory
13
(6), 1989, pp. 749-762