Strategies for hotlink assignments

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1969, Issue , 2000, Pages 23-34

  Bose, Prosenjit ^a   Czyzowicz, Jurek ^b   Gąsieniec, Leszek ^c   Kranakis, Evangelos ^a   Krizanc, Danny ^a   Pelc, Andrzej ^b   Martin, Miguel Vargas ^a  

^a CARLETON UNIVERSITY   (Canada)

^b UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^c UNIVERSITY OF LIVERPOOL   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BINARY TREES; DIRECTED GRAPHS; PROBABILITY DISTRIBUTIONS; TREES (MATHEMATICS);

AVERAGE NUMBERS; COMPLETE BINARY TREE; DIRECTED ACYCLIC GRAPH (DAG); GEOMETRIC DISTRIBUTION; HOTLINKS; NP COMPLETE; SOURCE NODES; UPPER AND LOWER BOUNDS;

WEBSITES;

EID: 84949790029     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-40996-3_3     Document Type: Conference Paper

References (11)

1. N. Abramson, “Information Theory and Coding”, McGraw Hill, 1963.
2. W. Aiello, F. Chung, L. Lu, “A random graph model for massive graphs". To appear in Proc. of the 32nd ACM Symp. on the Theory of Computing, 2000.
3. J. Czyzowicz, E. Kranakis, A. Pelc, M. Vargas Martin, “Optimal Assignment of Bookmarks to Web Pages”, to appear.
4. M. Faloutsos, P. Faloutsos, C. Faloutsos, “On Power-Law Relationships of the Internet Topology”, In proceedings of SIGCOM: IEEE Conference on Communication, 1999.
5. M.R. Garey and D.S. Johnson, “Computers and Intractability: A Guide to the Theory of NP-Completeness”, Freeman and Co., New York, 1979.
6. J. M. Kleinberg, R. Kumar, P. Raghavan, S. Rajagopalan, A. S. Tomkins, “The Web as a graph: measurements, models, and methods. In Proc. of the Fifth Int. Conf. on Computing and Combinatorics”, Springer-Verlag, pages 1-17, 1999.
7. D. Knuth, “The Art of Computer Programming: Volume 1, Fundamental Algorithms”, Addison Wesley, 2nd ed., 1997.
8. D. Knuth, “The Art of Computer Programming: Volume 3, Sorting and Searching”, Addison Wesley, 3rd ed., 1998.
9. B. Li, M. Golin, G. Italiano, X. Deng and K. Sohraby, “On the Optimal Placement of Web Proxies in the Internet”, IEEE InfoCom'99, pp.1282-1290, 1999.
10. B. Li, X. Deng, M. Golin, and K. Sohraby, “On the Optimal Placement of Web Proxies in the Internet”, 8th IFIP Conf. on High Performance Networking, 1998.
11. C. K. Zipf. “Human Behavior and the Principle of Least Effort”, Reading Mass., Addison Wesley, 1949.