Author： Ambuhl C. Gartner B. von Stengel
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.268, Iss.1, 2001-10, pp. : 3-16
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
A new lower bound for the open-shop problem
Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. :
Access to resources
Recommend
A competitive analysis of the list update problem with lookahead
By Albers S.
Theoretical Computer Science, Vol. 197, Iss. 1, 1998-05 ,pp. :
Annals of Operations Research, Vol. 110, Iss. 1-4, 2002-02 ,pp. :
A new lower bound for the bipartite crossing number with applications
By Shahrokhi F. Sykora O. Szekely L.A. Vrt'o I.
Theoretical Computer Science, Vol. 245, Iss. 2, 2000-08 ,pp. :