Author:
Wang Haichao,Wang Nian,Zhang Yan,Xiao Jingting,Sun Yuqin
Funder
Natural Science Foundation of Shanghai
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Reference14 articles.
1. Ausiello, G., Crescenzi, P., Gambosi, G., Kann, V., Marchetti-Spaccamela, A., Protasi, M.: Complexity and Approximation. Springer, Berlin (1999)
2. Cicalese, F., Milanič, M., Vaccaro, U.: Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs. In: Proceeding of the 18th international conference on fundamentals of computation theory, FCT’11. Springer, Berlin (2011), 288–297
3. Du, D.Z., Ko, K.I.: Theory of Computational Complexity. Wiley, New york (2000)
4. Dinh, T.N., Shen, Y.L., Nguyen, D.T., Thai, M.T.: On the approximability of positive influence dominating set in social networks. J. Combin. Optim. 27, 487–503 (2014)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., San Francisco, New York (1979)