#### Filter Results:

#### Publication Year

2009

2010

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

Given a network G = (V, E), we say that a subset of vertices S ⊆ V has radius r if it is spanned by a tree of depth r. We are interested in determining whether G has a cutset that can be written as the union of k sets of radius r. This generalizes the notion of k-vertex connectivity, since in the special case r = 0, a set spanned by a tree of depth r is a… (More)

We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edge-disjoint paths? Equivalently, we wish to find a maximum weighted packing of disjoint paths, where the weight of a path is the minimum capacity of an edge on the path. Our main result is an Ω(log n) lower bound on the… (More)

- ‹
- 1
- ›