Author： Poranen T.
Publisher： Taylor & Francis Ltd
ISSN： 0020-7160
Source： International Journal of Computer Mathematics, Vol.81, Iss.5, 2004-05, pp. : 555-568
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
Local approximations for maximum partial subgraph problem
By Monnot J. Paschos V.T. Toulouse S.
Operations Research Letters, Vol. 32, Iss. 3, 2004-05 ,pp. :
Access to resources
Recommend
Tight Bounds for the Maximum Acyclic Subgraph Problem
Journal of Algorithms, Vol. 25, Iss. 1, 1997-10 ,pp. :
Generalized simulated annealing algorithm applied in the ellipsometric inversion problem
Thin Solid Films, Vol. 425, Iss. 1, 2003-02 ,pp. :
Journal of Mathematical Modelling and Algorithms, Vol. 3, Iss. 1, 2004-01 ,pp. :