599 search results - page 42 / 120 » Approximation Algorithms for Dominating Set in Disk Graphs |
115
click to vote
JCO
2008
15 years 3 months ago
2008
We study Connected Facility Location problems. We are given a connected graph G = (V, E) with nonnegative edge cost ce for each edge e E, a set of clients D V such that each cli...
117
click to vote
PODC
2006
ACM
15 years 9 months ago
2006
ACM
This paper presents a distributed algorithm for wireless adhoc networks that runs in polylogarithmic number of rounds in the size of the network and constructs a lightweight, line...
131
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Bidimensionality theory appears to be a powerful framework for the development of metaalgorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
137
click to vote
ICCV
1999
IEEE
16 years 5 months ago
1999
IEEE
In this paper we address the problem of minimizing a large class of energy functions that occur in early vision. The major restriction is that the energy function's smoothnes...
105
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...