783 search results - page 113 / 157 » Improved approximation algorithms for the freeze-tag problem |
FOCS
2006
IEEE
14 years 2 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
CIAC
2006
Springer
14 years 12 days ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
COCOON
2008
Springer
13 years 10 months ago
2008
Springer
In this paper, we study the spectrum assignment problem for wireless access networks. Opportunistic spectrum usage is a promising technology. However, it could suffer from the self...
DISOPT
2008
13 years 8 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
ICASSP
2009
IEEE
14 years 3 months ago
2009
IEEE
In the last few years, we have witnessed an explosion in applications of sparse representation, the majority of which share the need for finding sparse solutions of underdetermine...