1566 search results - page 99 / 314 » On a Cone Covering Problem |
156
click to vote
APPROX
2004
Springer
15 years 11 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
172
click to vote
COR
2007
15 years 6 months ago
2007
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
160
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
197
click to vote
WSNA
2003
ACM
15 years 11 months ago
2003
ACM
One fundamental issue in sensor networks is the coverage problem, which reflects how well a sensor network is monitored or tracked by sensors. In this paper, we formulate this pr...
151
click to vote
HICSS
2002
IEEE
15 years 11 months ago
2002
IEEE
Teamwork is always challenging. Adding the complication of problem solving and software design only amplifies this challenge. The challenges of developing software as a team can b...