Author:
Bazgan Cristina,Brankovic Ljiljana,Casel Katrin,Fernau Henning
Publisher
Springer International Publishing
Reference46 articles.
1. Lecture Notes in Computer Science;FN Abu-Khzam,2014
2. Alimonti, P., Kann, V.: Some APX-completeness results for cubic graphs. Theor. Comput. Sci. 237(1–2), 123–134 (2000)
3. Arora, S., Karger, D.R., Karpinski, M.: Polynomial time approximation schemes for dense instances of NP-hard problems. J. Comput. Syst. Sci. 58(1), 193–210 (1999)
4. Athanassopoulos, S., Caragiannis, I., Kaklamanis, C.: Analysis of approximation algorithms for
$$k$$
-set cover using factor-revealing linear programs. Theor. Comput. Syst. 45(3), 555–576 (2009)
5. Ausiello, G., Creczenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation; Combinatorial Optimization Problems and Their Approximability Properties. Springer, Heidelberg (1999)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献