46 search results - page 4 / 10 » Approximating the minimum directed tree cover |
ACID
2006
13 years 8 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...
ISAAC
2004
Springer
14 years 21 days ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
SECON
2008
IEEE
14 years 1 months ago
2008
IEEE
Abstract—In contrast to existing work on the connected coverage problem in wireless sensor networks which assumes omnidirectional sensors with disk-like sensing range, this paper...
ESA
2003
Springer
14 years 17 days ago
2003
Springer
We prove that various geometric covering problems, related to the Travelling Salesman Problem cannot be efficiently approximated to within any constant factor unless P = NP. This ...
GECCO
2005
Springer
14 years 26 days ago
2005
Springer
Many real-world problems are multi-objective optimization problems and evolutionary algorithms are quite successful on such problems. Since the task is to compute or approximate t...