1388 search results - page 60 / 278 » Approximability of Robust Network Design |
WEA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
ORL
1998
13 years 7 months ago
1998
Recently, Becker and Geiger and Bafna, Berman and Fujito gave 2-approximation algorithms for the feedback vertex set problem in undirected graphs. We show how their algorithms can...
AMCS
2010
13 years 7 months ago
2010
satisfactory network connectivity have dominated this line of research and abstracted away from the mathematical description of the physical processes underlying the observed pheno...
BROADNETS
2004
IEEE
13 years 11 months ago
2004
IEEE
We present a fast local clustering service, FLOC, that partitions a multi-hop wireless network into nonoverlapping and approximately equal-sized clusters. Each cluster has a clust...
JMLR
2006
13 years 7 months ago
2006
The goal of active learning is to determine the locations of training input points so that the generalization error is minimized. We discuss the problem of active learning in line...