Author： Riedel
Publisher： Elsevier
ISSN： 0304-3975
Source： Theoretical Computer Science, Vol.268, Iss.1, 2001-10, pp. : 145-160
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
On-line matching routing on trees
Theoretical Computer Science, Vol. 220, Iss. 2, 1999-06 ,pp. :
Access to resources
Recommend
On-line string matching with feedback
By Johansen P.
Theoretical Computer Science, Vol. 141, Iss. 1, 1995-04 ,pp. :
On-line single-server dial-a-ride problems
By Feuerstein
Theoretical Computer Science, Vol. 268, Iss. 1, 2001-10 ,pp. :
An optimal deterministic algorithm for online b-matching
By Kalyanasundaram B. Pruhs K.R.
Theoretical Computer Science, Vol. 233, Iss. 1, 2000-02 ,pp. :