Travelled to:1 × Canada
1 × Latvia
1 × The Netherlands
1 × United Kingdom
6 × USA
Collaborated with:C.Chekuri S.Khanna G.Naves N.Goyal N.Olver M.Mydlarz Y.Azar I.R.Cohen S.Kamara N.Jain I.Menache J.Naor P.Donovan A.Vetta G.T.Wilfong V.Guruswami R.Rajaraman M.Yannakakis
Talks about:flow (4) multicommod (3) disjoint (3) problem (3) path (3) edg (3) network (2) graph (2) oversubscrib (1) constrain (1)
Person: F. Bruce Shepherd
DBLP: Shepherd:F=_Bruce
Contributed to:
2013
201320122008200720062005200420031999Wrote 10 papers:
- ICALP-v1-2013-ChekuriNS #graph
- Maximum Edge-Disjoint Paths in k-Sums of Graphs (CC, GN, FBS), pp. 328–339.
- STOC-2013-AzarCKS #bound #online
- Tight bounds for online vector bin packing (YA, IRC, SK, FBS), pp. 961–970.
- ICALP-v2-2012-JainMNS #migration #network #virtual machine
- Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks (NJ, IM, JN, FBS), pp. 586–597.
- STOC-2008-GoyalOS
- The vpn conjecture is true (NG, NO, FBS), pp. 443–450.
- STOC-2007-DonovanSVW #network
- Degree-constrained network flows (PD, FBS, AV, GTW), pp. 681–688.
- STOC-2006-ChekuriKS #constant #graph
- Edge-disjoint paths in Planar graphs with constant congestion (CC, SK, FBS), pp. 757–766.
- STOC-2005-ChekuriKS #multi #problem
- Multicommodity flow, well-linked terminals, and routing problems (CC, SK, FBS), pp. 183–192.
- STOC-2004-ChekuriKS #multi #problem
- The all-or-nothing multicommodity flow problem (CC, SK, FBS), pp. 156–165.
- ICALP-2003-ChekuriMS #multi
- Multicommodity Demand Flow in a Tree (CC, MM, FBS), pp. 410–425.
- STOC-1999-GuruswamiKRSY #algorithm #approximate #problem
- Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems (VG, SK, RR, FBS, MY), pp. 19–28.