402 search results - page 12 / 81 » Constant-Time Approximation Algorithms via Local Improvement... |
MFCS
2009
Springer
14 years 3 days ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
INFOCOM
2009
IEEE
14 years 2 months ago
2009
IEEE
— In this paper, we study sensor enabled landmine networks by formulating a minimum-cost mine selection problem. The problem arises in a target defence scenario, where the object...
MFCS
2005
Springer
14 years 1 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...
ICNP
2006
IEEE
14 years 1 months ago
2006
IEEE
—Data caching can significantly improve the efficiency of information access in a wireless ad hoc network by reducing the access latency and bandwidth usage. However, designing e...
FOCS
2008
IEEE
14 years 2 months ago
2008
IEEE
We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves ...