Author:
Asahiro Yuichi,Kanmera Kenta,Miyano Eiji
Publisher
Springer Berlin Heidelberg
Reference12 articles.
1. Albers, S., Arora, S., Khanna, S.: Page replacement for general caching problems. In: 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1999), pp. 31–40 (1999)
2. Lecture Notes in Computer Science;J.W.T. Chan,2009
3. Chan, J.W.T., Chin, F.Y.L., Ting, H.F., Zhang, Y.: Online problems for frequency assignment and OVSF code assignment in wireless communication networks. ACM SIGACT News 40(3), 86–98 (2009)
4. Chin, F.Y.L., Ting, H.F., Zhang, Y.: A constant-competitive algorithm for online OVSF code assignment. Algorithmica 56(1), 89–104 (2010)
5. Chin, F.Y.L., Ting, H.F., Zhang, Y.: Constant-competitive tree node assignment (manuscript)