30 search results - page 1 / 6 » Approximating Fault-Tolerant Group-Steiner Problems |
FSTTCS
2009
Springer
14 years 5 months ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
DAM
2006
13 years 11 months ago
2006
FSTTCS
2003
Springer
14 years 4 months ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
ICALP
2009
Springer
14 years 11 months ago
2009
Springer
We improve the approximation ratios for two optimization problems in planar graphs. For node-weighted Steiner tree, a classical network-optimization problem, the best achievable ap...
ESANN
2001
14 years 7 days ago
2001
This paper describes a method of supervised learning based on forward selection branching. This method improves fault tolerance by means of combining information related to general...