496 search results - page 32 / 100 » A Polynomial-Time Approximation Algorithm for a Geometric Di... |
SODA
2004
ACM
13 years 9 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
STOC
2010
ACM
14 years 16 days ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
INFOCOM
2008
IEEE
14 years 2 months ago
2008
IEEE
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
CCCG
2010
13 years 9 months ago
2010
We obtain hardness results and approximation algorithms for two related geometric problems involving movement. The first is a constrained variant of the k-center problem, arising ...
STOC
2003
ACM
14 years 8 months ago
2003
ACM
We present a general approach for designing approximation algorithms for a fundamental class of geometric clustering problems in arbitrary dimensions. More specifically, our appro...