Database Reference
In-Depth Information
[2] B. Kalyanasundaram and K.R. Pruhs, “An optimal deterministic algorithm for b-matching,”
Theoretical Com-
puter Science
233:1-2, pp. 319-325, 2000.
[3] A Mehta, A. Saberi, U. Vazirani, and V. Vazirani, “Adwords and generalized on-line matching,”
IEEE Symp. on
Foundations of Computer Science
, pp. 264-273, 2005.
1
Unfortunately, we are faced with another case of dual meanings, like the coincidence involving the term “cluster” that
we noted in
Section 7.6.6
, where we needed to interpret properly phrases such as “algorithms for computing clusters
on computer clusters.” Here, the term “on-line” refers to the nature of the algorithm, and should not be confused with
“on-line” meaning “on the Internet” in phrases such as “on-line algorithms for on-line advertising.”
3
Thanks to Anna Karlin for this example.