Author: Jonsson P.
Publisher: Springer Publishing Company
ISSN: 1012-2443
Source: Annals of Mathematics and Artificial Intelligence, Vol.26, Iss.1-4, 1999-01, pp. : 133-147
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
Propositional lower bounds: Algorithms and complexity
By Cadoli M.
Annals of Mathematics and Artificial Intelligence, Vol. 27, Iss. 1-4, 1999-01 ,pp. :
The non-approximability of bicriteria network design problems
By Balint V.
Journal of Discrete Algorithms, Vol. 1, Iss. 3, 2003-06 ,pp. :