370 search results - page 39 / 74 » Improved Approximation Algorithms for Connected Sensor Cover |
COCOA
2008
Springer
15 years 1 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
SODA
1997
ACM
15 years 1 months ago
1997
ACM
We study graph partitioning problems on graphs with edge capacities and vertex weights. The problems of b-balanced cuts and k-balanced partitions are unified into a new problem ca...
IPPS
2006
IEEE
15 years 5 months ago
2006
IEEE
Wireless mesh networks recently emerge as a flexible, low-cost and multipurpose networking platform with wired infrastructure connected to the Internet. A critical issue in mesh ...
101
click to vote
ACIVS
2008
Springer
15 years 6 months ago
2008
Springer
Within a camera network, the contribution of a camera to the observations of a scene depends on its viewpoint and on the scene configuration. This is a dynamic property, as the sc...
112
click to vote
ICALP
2010
Springer
15 years 4 months ago
2010
Springer
Some of the currently best-known approximation algorithms for network design are based on random sampling. One of the key steps of such algorithms is connecting a set of source nod...