370 search results - page 4 / 74 » Improved Approximation Algorithms for Connected Sensor Cover |
COCOA
2008
Springer
13 years 9 months ago
2008
Springer
Connected Vertex Cover Problem (CVC) is an NP-hard problem. The currently best known approximation algorithm for CVC has performance ration 2. This paper gives the first Polynomial...
INFOCOM
2010
IEEE
13 years 5 months ago
2010
IEEE
—We study how to characterize the families of paths between any two nodes s, t in a sensor network with holes. Two paths that can be deformed to one another through local changes...
WADS
2005
Springer
14 years 25 days ago
2005
Springer
We consider an APX-hard variant (∆-Max-ATSP) and an APX-hard relaxation (Max-3-DCC) of the classical traveling salesman problem. We present a 31 40-approximation algorithm for â...
IPL
2011
13 years 2 months ago
2011
Arpe and Manthey [Algorithmica’09] recently studied the minimum ANDcircuit problem, which is a circuit minimization problem, and showed some results including approximation algo...
ESA
2009
Springer
14 years 1 months ago
2009
Springer
In this paper we consider both the maximization variant Max Rep and the minimization variant Min Rep of the famous Label Cover problem, for which, till now, the best approximation ...