331 search results - page 38 / 67 » Approximation Algorithms for Connected Dominating Sets |
127
click to vote
SODA
2010
ACM
15 years 9 months ago
2010
ACM
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
111
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
d Abstract) Sara Ahmadian∗ Chaitanya Swamy∗ We consider the lower-bounded facility location (LBFL) problem (also sometimes called load-balanced facility location), which is a ...
110
click to vote
MVA
2007
15 years 1 months ago
2007
In this paper a new approach to finding and tracking various land cover boundaries such as rivers, agricultural fields, channels and roads for use in visual navigation system of a...
100
click to vote
STOC
2009
ACM
16 years 12 days ago
2009
ACM
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
132
click to vote
ESA
2003
Springer
15 years 5 months 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 ...