30 search results - page 1 / 6 » Approximating Fault-Tolerant Group-Steiner Problems |
98
Voted
FSTTCS
2009
Springer
15 years 6 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
14 years 12 months ago
2006
125
click to vote
FSTTCS
2003
Springer
15 years 5 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...
102
click to vote
ICALP
2009
Springer
16 years 3 days 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...
103
click to vote
ESANN
2001
15 years 1 months 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...