13 search results - page 3 / 3 » A New Algorithm for Finding Minimal Cycle-Breaking Sets of T... |
AAIM
2006
Springer
13 years 9 months ago
2006
Springer
Due to the increasing security threats on the Internet, new overlay network architectures have been proposed to secure privileged services. In these architectures, the application...
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We study integrality gaps and approximability of two closely related problems on directed graphs. Given a set V of n nodes in an underlying asymmetric metric and two specified nod...
COCOON
2008
Springer
13 years 7 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...