Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
A survey of approximately optimal solutions to some covering and packing problems
ACM Computing Surveys (CSUR)
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Approximating maximum independent set in bounded degree graphs
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Broadcast scheduling for TDMA in wireless multihop networks
Handbook of wireless networks and mobile computing
The Inapproximability of Non NP-hard Optimization Problems
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Computational Geometry: Theory and Applications
Wireless coverage via dynamic programming
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
Wireless coverage with disparate ranges
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Hi-index | 0.00 |