Approximate dynamic programming for link scheduling in wireless mesh networks
Computers and Operations Research
A polynomial-time approximation scheme for the geometric unique coverage problem on unit squares
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Hi-index | 0.01 |