An Approximation Algorithm for Binary Searching in Trees

ISSN： 0178-4617

Source： Algorithmica, Vol.59, Iss.4, 2011-04, pp. : 601-620

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

A fast distributed approximation algorithm for minimum spanning trees

By Khan Maleq Pandurangan Gopal

Distributed Computing, Vol. 20, Iss. 6, 2008-04 ,pp. : 391-402

Springer Publishing Company

Access to resources Recommend Favorite

Efficient String Matching Algorithm for Searching Large DNA and Binary Texts

International Journal on Semantic Web and Information Systems (IJSWIS), Vol. 13, Iss. 4, 2017-10 ,pp. : 198-220

IGI Global_journal

Access to resources Recommend Favorite

An improved lower bound and approximation algorithm for binary constrained quadratic programming problem

By Lu Cheng Wang Zhenbo Xing Wenxun

Journal of Global Optimization, Vol. 48, Iss. 3, 2010-11 ,pp. : 497-508

Springer Publishing Company

Access to resources Recommend Favorite

A Parallel Algorithm for Optimum Height-Limited Alphabetic Binary Trees

By Larmore L.L. Przytycka T.M.

Journal of Parallel and Distributed Computing, Vol. 35, Iss. 1, 1996-05 ,pp. : 49-56

Academic Press

Access to resources Recommend Favorite

Edge and node searching problems on trees

By Peng

Theoretical Computer Science, Vol. 240, Iss. 2, 2000-06 ,pp. : 429-446

Elsevier

Access to resources Recommend Favorite