Author： Aazami A. Cheriyan J. Jampani K.
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.63, Iss.1-2, 2012-06, pp. : 425-456
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Hardness results and approximation algorithms of k-tuple domination in graphs
Information Processing Letters, Vol. 89, Iss. 2, 2004-01 ,pp. :
Access to resources
Recommend
Approximation Algorithms for Extensible Bin Packing
Journal of Scheduling, Vol. 9, Iss. 1, 2006-02 ,pp. :
Parallel local search for Steiner trees in graphs
By Verhoeven M.G.A. Severens M.E.M.
Annals of Operations Research, Vol. 90, Iss. 1, 1999-01 ,pp. :
On approximation algorithms for the terminal Steiner tree problem
Information Processing Letters, Vol. 89, Iss. 1, 2004-01 ,pp. :