1671 search results - page 62 / 335 » On the Covering Steiner Problem |
226
click to vote
ICDE
2009
IEEE
16 years 2 months ago
2009
IEEE
Increasing prevalence of large-scale distributed monitoring and computing environments such as sensor networks, scientific federations, Grids etc., has led to a renewed interest in...
109
Voted
COCOA
2009
Springer
15 years 5 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...
ICCNMC
2005
Springer
15 years 6 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...
128
Voted
APPROX
2005
Springer
15 years 6 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...
128
click to vote
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...