1424 search results - page 25 / 285 » The Multi-radius Cover Problem |
58
Voted
NETWORKS
2007
15 years 5 days ago
2007
63
Voted
MP
2010
14 years 11 months ago
2010
56
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
200
click to vote
ACID
2006
15 years 2 months ago
2006
We consider the concepts of a t-total vertex cover and a t-total edge cover (t 1), which generalize the notions of a vertex cover and an edge cover, respectively. A t-total verte...
101
click to vote
WEA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The vertex cover problem is a classical NP-complete problem for which the best worst-case approximation ratio is 2− o(1). In this paper, we use a collection of simple g...