Hardness results and approximation algorithms of k-tuple domination in graphs

Author： Klasing R.   Laforest C.  

Publisher： Elsevier

ISSN： 0020-0190

Source： Information Processing Letters, Vol.89, Iss.2, 2004-01, pp. : 75-83

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

Abstract

Related content

Improved Algorithms and Complexity Results for Power Domination in Graphs

By Guo Jiong   Niedermeier Rolf   Raible Daniel  

Algorithmica, Vol. 52, Iss. 2, 2008-10 ,pp. : 177-202

Springer Publishing Company

Access to resources Recommend Favorite

Approximation Algorithms and Hardness Results for Packing Element-Disjoint Steiner Trees in Planar Graphs

By Aazami A.   Cheriyan J.   Jampani K.  

Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. : 425-456

Springer Publishing Company

Access to resources Recommend Favorite

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

By Guruswami V.   Khanna S.   Rajaraman R.   Shepherd B.   Yannakakis M.  

Journal of Computer and System Sciences, Vol. 67, Iss. 3, 2003-11 ,pp. : 473-496

Elsevier

Access to resources Recommend Favorite

New Approximation Algorithms for Minimum Cycle Bases of Graphs

By Kavitha Telikepalli   Mehlhorn Kurt   Michail Dimitrios  

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 471-488

Springer Publishing Company

Access to resources Recommend Favorite

Hardness results for neural network approximation problems

By Bartlett P.L.   Ben-David S.  

Theoretical Computer Science, Vol. 284, Iss. 1, 2002-07 ,pp. : 53-66

Elsevier

Access to resources Recommend Favorite