Author： Revalski J. Zhivkov N.
Publisher： Springer Publishing Company
ISSN： 0925-5001
Source： Journal of Global Optimization, Vol.50, Iss.1, 2011-05, pp. : 77-91
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Abstract
Related content
Approximation Algorithms for Connected Dominating Sets
Algorithmica, Vol. 20, Iss. 4, 1998-04 ,pp. :
Access to resources
Recommend
Near-Linear Approximation Algorithms for Geometric Hitting Sets
By Agarwal Pankaj Ezra Esther Sharir Micha
Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. :
By Luo Qiang Yi Dongyun Yang Wenqiang
Kybernetes: The International Journal of Systems & Cybernetics, Vol. 38, Iss. 3-4, 2009-01 ,pp. :
On the approximation of largest common subtrees and largest common point sets
Theoretical Computer Science, Vol. 233, Iss. 1, 2000-02 ,pp. :