On the approximability of positive influence dominating set in social networks

Author： Dinh Thang   Shen Yilin   Nguyen Dung   Thai My  

Publisher： Springer Publishing Company

ISSN： 1382-6905

Source： Journal of Combinatorial Optimization, Vol.27, Iss.3, 2014-04, pp. : 487-503

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Approximability issues of guarding a set of segments

By Brimkov Valentin E.  

International Journal of Computer Mathematics, Vol. 90, Iss. 8, 2013-08 ,pp. : 1653-1667

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Note on Balancedness of Dominating Set Games

By Fang Qizhi   Kim Hye  

Journal of Combinatorial Optimization, Vol. 10, Iss. 4, 2005-12 ,pp. : 303-310

Springer Publishing Company

Access to resources Recommend Favorite

Approximation hardness of edge dominating set problems

By Chlebík Miroslav   Chlebíková Janka  

Journal of Combinatorial Optimization, Vol. 11, Iss. 3, 2006-05 ,pp. : 279-290

Springer Publishing Company

Access to resources Recommend Favorite

Which trees have a differentiating-paired dominating set?

By Henning Michael  

Journal of Combinatorial Optimization, Vol. 22, Iss. 1, 2011-07 ,pp. : 1-18

Springer Publishing Company

Access to resources Recommend Favorite

A survey of approximability and inapproximability results for social welfare optimization in multiagent resource allocation

By Nguyen Trung   Roos Magnus   Rothe Jörg  

Annals of Mathematics and Artificial Intelligence, Vol. 68, Iss. 1-3, 2013-07 ,pp. : 65-90

Springer Publishing Company

Access to resources Recommend Favorite