65 search results - page 8 / 13 » Nature Reserve Selection Problem: A Tight Approximation Algo... |
LATIN
2010
Springer
15 years 2 months ago
2010
Springer
In this paper we design an iterative rounding approach for the classic prize-collecting Steiner forest problem and more generally the prize-collecting survivable Steiner network de...
ESANN
2001
14 years 11 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...
IPSN
2010
Springer
15 years 4 months ago
2010
Springer
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
101
Voted
SODA
2003
ACM
14 years 11 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
PLDI
2009
ACM
15 years 4 months ago
2009
ACM
It is often impossible to obtain a one-size-fits-all solution for high performance algorithms when considering different choices for data distributions, parallelism, transformati...