Author： Nutov Zeev
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.63, Iss.1-2, 2012-06, pp. : 398-410
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
Access to resources
Recommend
A Unified Approach to Approximating Partial Covering Problems
By Könemann Jochen Parekh Ojas Segev Danny
Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. :
Edge and node searching problems on trees
By Peng
Theoretical Computer Science, Vol. 240, Iss. 2, 2000-06 ,pp. :
A space lower bound for st-connectivity on node-named JAGs
By Poon C.K.
Theoretical Computer Science, Vol. 237, Iss. 1, 2000-04 ,pp. :