841 search results - page 71 / 169 » Approximability of Minimum AND-Circuits |
145
click to vote
WIOPT
2005
IEEE
15 years 8 months ago
2005
IEEE
We consider the problem of transmission scheduling of data over a wireless fading channel with hard deadline constraints. Our system consists of N users, each with a fixed amount...
115
click to vote
AAIM
2007
Springer
15 years 9 months ago
2007
Springer
The disc covering problem asks to cover a set of points on the plane with a minimum number of fix-sized discs. We develop an O(n(log n)2 (log log n)2 ) deterministic time 2.8334-a...
158
click to vote
COMPGEOM
2008
ACM
15 years 4 months ago
2008
ACM
We introduce a hierarchical partitioning scheme of the Euclidean plane, called circular partitions. Such a partition consists of a hierarchy of convex polygons, each having small ...
134
click to vote
ALGORITHMICA
2008
15 years 3 months ago
2008
The notion of -kernel was introduced by Agarwal et al. [5] to set up a unified framework for computing various extent measures of a point set P approximately. Roughly speaking, a ...
109
click to vote
TIT
2008
15 years 3 months ago
2008
The identifying code problem for a given graph involves finding a minimum set of vertices whose neighborhoods uniquely overlap at any given graph vertex. Initially introduced in 1...