1671 search results - page 133 / 335 » On the Covering Steiner Problem |
174
click to vote
FCT
2003
Springer
15 years 12 months ago
2003
Springer
: Proving integrality gaps for linear relaxations of NP optimization problems is a difficult task and usually undertaken on a case-by-case basis. We initiate a more systematic app...
157
Voted
DISOPT
2006
15 years 6 months ago
2006
We propose an effective heuristic to save memory in dynamic programming on tree decompositions when solving graph optimization problems. The introduced "anchor technique"...
178
click to vote
RECOMB
2004
Springer
16 years 7 months ago
2004
Springer
This paper is concerned with the reconstruction of perfect phylogenies from binary character data with missing values, and related problems of inferring complete haplotypes from h...
185
click to vote
CPAIOR
2008
Springer
15 years 8 months ago
2008
Springer
This paper extends our previous work by exploring the use of a hybrid solution method for solving the connection subgraph problem. We employ a two phase solution method, which dras...
220
click to vote
UIC
2007
Springer
16 years 25 days ago
2007
Springer
Abstract. The coverage problem in wireless sensor networks (WSNs) is to determine the number of active sensor nodes needed to cover the sensing area. The purpose is to extend the l...