1671 search results - page 108 / 335 » On the Covering Steiner Problem |
219
click to vote
ALGOSENSORS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
165
click to vote
DAM
2007
15 years 6 months ago
2007
In the partially-ordered knapsack problem (POK) we are given a set N of items and a partial order ≺P on N. Each item has a size and an associated weight. The objective is to pac...
206
click to vote
ALGORITHMICA
1998
15 years 6 months ago
1998
The dominatingset problemin graphs asks for a minimumsize subset of vertices with the followingproperty: each vertex is required to either be in the dominating set, or adjacent to...
166
click to vote
EOR
2007
15 years 6 months ago
2007
This paper studies an arc routing problem with capacity constraints and time-dependent service costs. This problem is motivated by winter gritting applications where the ‘‘tim...
152
click to vote
SAC
1997
ACM
15 years 10 months ago
1997
ACM
At the 1996 Symposium on Applied Computing, it was argued that the R-by-C Crozzle problem was NP-Hard, but not in NP. The original Crozzle problem is a word puzzle that appears, w...