Author： Bar-Yehuda R. Rawitz D.
Publisher： Elsevier
ISSN： 0196-6774
Source： Journal of Algorithms, Vol.42, Iss.1, 2002-01, pp. : 20-40
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
Approximating Clique and Biclique Problems
Journal of Algorithms, Vol. 29, Iss. 1, 1998-10 ,pp. :
Access to resources
Recommend
Approximating Unweighted Connectivity Problems in Parallel
By Chen Z-Z.
Information and Computation, Vol. 171, Iss. 2, 2001-12 ,pp. :
On efficient fixed-parameter algorithms for weighted vertex cover
By Niedermeier R. Rossmanith P.
Journal of Algorithms, Vol. 47, Iss. 2, 2003-07 ,pp. :
Approximating Layout Problems on Random Geometric Graphs
By Díaz J. Penrose M.D. Petit J. Serna M.
Journal of Algorithms, Vol. 39, Iss. 1, 2001-04 ,pp. :