Author： Breslauer D.
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.209, Iss.1, 1998-12, pp. : 365-375
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
Two short notes on the on-line travelling salesman: handling times and lookahead
By Damaschke P.
Theoretical Computer Science, Vol. 289, Iss. 1, 2002-10 ,pp. :
Access to resources
Recommend
Competitive analysis of incentive compatible on-line auctions
Theoretical Computer Science, Vol. 310, Iss. 1, 2004-01 ,pp. :
A competitive analysis of the list update problem with lookahead
By Albers S.
Theoretical Computer Science, Vol. 197, Iss. 1, 1998-05 ,pp. :
Online paging and file caching with expiration times
By Kimbrel T.
Theoretical Computer Science, Vol. 268, Iss. 1, 2001-10 ,pp. :