Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Baker, B.: Approximation Algorithms for NP-Complete Problems on Planar Graphs. Journal of the ACM 41(1), 153–180 (1994)
2. Berman, P., Karpinski, M.: On Some Tighter Inapproximability Results. In: Proc. 26th ICALP, pp. 200–209 (1999), Also available as ECCC Report TR98-065 at http://eccc.uni-trier.de/eccc/
3. Călinescu, G., Măndoiu, I., Zelikovsky, A.: Symmetric Connectivity with Minimum Power Consumption in Radio Networks. In: Proc. IFIP TCS, vol. 223, pp. 119–130 (2002)
4. Chlebík, M., Chlebíková, J.: Inapproximability results for bounded variants of optimization problems. In: Lingas, A., Nilsson, B.J. (eds.) FCT 2003. LNCS, vol. 2751, pp. 27–38. Springer, Heidelberg (2003), Also available as ECCC Report TR03-026
5. Clementi, A., Crescenzi, P., Penna, P., Rossi, G., Vocca, P.: A Worst-Case Analysis of an MST-based Heuristic to Construct Energy-Efficient Broadcast Trees in Wireless Networks. Technical Report 010, University of Rome “Tor Vergata”, Math. Department (2001)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献