Publisher
Springer Science and Business Media LLC
Reference23 articles.
1. Garey, M.R.; Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA (1979). http://dl.acm.org/citation.cfm?id=578533
2. Engebretsen, L.; Holmerin, J.: Clique is hard to approximate within n 1-o(1). In: Montanari, U.; Rolim, J.D.P.; Welzl, E. (eds.) Automata, Languages and Programming. Lecture Notes in Computer Science, no. 1853, pp. 2–12. Springer, Berlin Heidelberg (2000)
3. Agarwal, P.K.; van Kreveld, M.; Suri, S.: Label placement by maximum independent set in rectangles. Comput. Geom. 11(3–4), 209–218 (1998)
4. Strijk, T.; Verweij, B.; Aardal, K.: Algorithms for maximum independent set applied to map labelling. Department of Computer Science, Utrecht University (2000)
5. Luo, H., Lu, S., Bharghavan, V.: A new model for packet scheduling in multihop wireless networks. In: Proceedings of the 6th Annual International Conference on Mobile Computing and Networking. MobiCom’00, pp. 76–86. ACM, New York (2000)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献