Author： Krupski
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.284, Iss.2, 2002-07, pp. : 397-417
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
Effective metric spaces and representations of the reals
Theoretical Computer Science, Vol. 284, Iss. 2, 2002-07 ,pp. :
Access to resources
Recommend
On the approximability of the Steiner tree problem
By Thimm M.
Theoretical Computer Science, Vol. 295, Iss. 1, 2003-02 ,pp. :
Approximability of Minimum AND-Circuits
Algorithmica, Vol. 53, Iss. 3, 2009-03 ,pp. :
Approximability of Sparse Integer Programs
By Pritchard David Chakrabarty Deeparnab
Algorithmica, Vol. 61, Iss. 1, 2011-09 ,pp. :
On the approximability of clique and related maximization problems
Journal of Computer and System Sciences, Vol. 67, Iss. 3, 2003-11 ,pp. :