Algorithm Design

8O4
Epilogue: Algorithms That Run Forever
(E.i~) By moving avo stable matchings in each time step, according, to the
preferences just defined, the switch is able to simulate the behavior of pare
output qaeaeing.
Overall, the algorithm makes for a surprising last-minute appearance by
the topic with which we began the book--and rather than matching men with
women or applicants with employers, we find ourselves matching input finks
to output links in a high-speed Internet router.
This has been one glimpse into the issue of algorithms that run forever,
keeping up with an infinite stream of new events. It is an intriguing topic, full
of open directions and unresolved issues. But that is for another time, and
another book; and, as for us, we are done.
References
E. Aarts and J. K. Lenstra (eds.). Local Search in Combinatorial Optimization.
Wiley, 1997.
R. K. Ahu)a, T. L. Magnanti, and J. B. Or]in. Network Flows: Theory, Algorithms,
and Applications. Prentice Hall, 1993.
N. Alon and J. Spencer. The Probabilistic Method (2nd edition). Wiley, 2000.
M. Anderberg. Cluster Analysis for Applications. Academic Press, 1973.
E. Anshelevich, A. Dasgupta, J. Kleinberg, 1~. Tardos, T. Wexier, and T. Roughgarden.
The price of stability for network design with fair cost allocation. Proc. 4Sth
IEEE Symposium on Foundations of Computer Science, pp. 295-304, 2004.
K. Appel and W. Haken. The solution of the four-color-map problem. Scientific
American, 237:4(1977), 108-121.
S. Arora and C. Lund. Hardness of approximations. In Approximation Algorithms
for N-P-Hard Problems, edited by D. S. Hochbaum. PWS Publishing, 1996.
B. Awerbuch, Y Azar, and S. Plotldn. Tkroughput-compefitive online routing,
Proc. 34th IEEE Symposium on Foundations of Computer Science, pp. 32-40, 1993.
R. Bar-Yehuda and S. Even. A linear-time approximation algorithm for the weighted
vertex cover problem. J. Algorithms 2 (1981), 198-203.
A.-L. Barabasi. Linked: The New Science of Networks. Perseus, 2002.
M. Beckmann, C. B. McGuire, and C. B. Winsten. Studies in the Economics of
Transportation. Yale University Press, 1956.
L. Belady. A study of replacement algorithms for virtual storage computers. !BM
Systems Journal 5 (1966), 78-101.
T. C. Bell, J. G. Cleary, and I. H. Witten. Text Compression. Prentice Hall, 1990.
R. E. Bellman. Dynamic Programming. Princeton University Press, 1957.