Author： Bateni MohammadHossein Hajiaghayi MohammadTaghi
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.62, Iss.3-4, 2012-04, pp. : 906-929
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
On the prize-collecting generalized minimum spanning tree problem
By Pop P.
Annals of Operations Research, Vol. 150, Iss. 1, 2007-03 ,pp. :
Access to resources
Recommend
A Lagrangian heuristic for the Prize CollectingTravelling Salesman Problem
Annals of Operations Research, Vol. 81, Iss. 1, 1998-01 ,pp. :
By Ellis J. Ruskey F. Sawada J. Simpson J.
Theoretical Computer Science, Vol. 301, Iss. 1, 2003-05 ,pp. :