628 search results - page 49 / 126 » Approximation Algorithms for Quickest Spanning Tree Problems |
125
click to vote
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
: A fundamental problem in communication networks is wavelength assignment (WA): given a set of routing paths on a network, assign a wavelength to each path such that the paths wit...
141
click to vote
GLOBECOM
2007
IEEE
15 years 9 months ago
2007
IEEE
— Virtual Private Networks (VPN) provide a secure and reliable communication between customer sites over a shared network. Two models were proposed for the service provisioning i...
117
click to vote
WADS
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
132
click to vote
STACS
1999
Springer
15 years 7 months ago
1999
Springer
We present a new technique called balanced randomized tree splitting. It is useful in constructing unknown trees recursively. By applying it we obtain two new results on efficient ...
129
click to vote
SODA
2001
ACM
15 years 4 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...