Bruce Shepherd
Cited by
Cited by
The stable paths problem and interdomain routing
TG Griffin, FB Shepherd, G Wilfong
IEEE/ACM Transactions On Networking 10 (2), 232-243, 2002
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems
V Guruswami, S Khanna, R Rajaraman, B Shepherd, M Yannakakis
Journal of Computer and System Sciences 67 (3), 473-496, 2003
System and method for locating a closest server in response to a client domain name request
M Andrews, M Hofmann, B Shepherd, A Srinivasan, P Winkler, F Zane
US Patent 7,020,698, 2006
Policy disputes in path-vector protocols
TG Griffin, FB Shepherd, G Wilfong
Proceedings. Seventh International Conference on Network Protocols, 21-30, 1999
Multicommodity demand flow in a tree and packing integer programs
C Chekuri, M Mydlarz, FB Shepherd
ACM Transactions on Algorithms (TALG) 3 (3), 27-es, 2007
Domination in graphs with minimum degree two
W McCuaig, B Shepherd
Journal of Graph Theory 13 (6), 749-762, 1989
Route oscillations in I-BGP with route reflection
A Basu, CHL Ong, A Rasala, FB Shepherd, G Wilfong
Proceedings of the 2002 conference on Applications, technologies …, 2002
The all-or-nothing multicommodity flow problem
C Chekuri, S Khanna, FB Shepherd
Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004
Multicommodity flow, well-linked terminals, and routing problems
C Chekuri, S Khanna, FB Shepherd
Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005
An O (√ n) approximation and integrality gap for disjoint paths and unsplittable flow
C Chekuri, S Khanna, FB Shepherd
Theory of computing 2 (1), 137-146, 2006
Clustering and server selection using passive monitoring
M Andrews, B Shepherd, A Srinivasan, P Winkler, F Zane
Proceedings. Twenty-First Annual Joint Conference of the IEEE Computer and …, 2002
Hardness of robust network design
C Chekuri, FB Shepherd, G Oriolo, MG Scutella
Networks: An International Journal 50 (1), 50-54, 2007
Co-location-resistant clouds
Y Azar, S Kamara, I Menache, M Raykova, B Shepard
Proceedings of the 6th Edition of the ACM Workshop on Cloud Computing …, 2014
Edge-disjoint paths in planar graphs with constant congestion
C Chekuri, S Khanna, FB Shepherd
SIAM Journal on Computing 39 (1), 281-301, 2009
Edge-disjoint paths in planar graphs
C Chekuri, S Khanna, FB Shepherd
45th Annual IEEE Symposium on Foundations of Computer Science, 71-80, 2004
An upper bound for the k‐domination number of a graph
EJ Cockayne, B Gamble, B Shepherd
Journal of graph theory 9 (4), 533-534, 1985
Method and apparatus for exchanging routing information within an autonomous system in a packet-based data network
A Basu, CHL Ong, AP Rasala, FB Sheperd, GT Wilfong
US Patent 7,180,864, 2007
Combinatorial optimization
GP Cornuéjols, F Eisenbrand, B Shepherd
Oberwolfach Reports 11 (4), 2873-2932, 2015
Applying Lehman's theorems to packing problems
FB Shepherd
Mathematical Programming 71 (3), 353-367, 1995
Hamiltonicity in claw-free graphs
FB Shepherd
Journal of Combinatorial Theory, Series B 53 (2), 173-194, 1991
The system can't perform the operation now. Try again later.
Articles 1–20