Author： Kortsarz Guy Mirrokni Vahab Nutov Zeev Tsanko Elena
Publisher： Springer Publishing Company
ISSN： 0178-4617
Source： Algorithmica, Vol.60, Iss.4, 2011-08, pp. : 735-742
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
Approximating Node-Connectivity Augmentation Problems
By Nutov Zeev
Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. :
Access to resources
Recommend
Approximating minimum feedback vertex sets in hypergraphs
By Fujito T.
Theoretical Computer Science, Vol. 246, Iss. 1, 2000-09 ,pp. :
A Unified Approach to Approximating Partial Covering Problems
By Könemann Jochen Parekh Ojas Segev Danny
Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. :