Fast shortest path distance estimation in large networks

International Conference on Information and Knowledge Management, Proceedings

Volumn , Issue , 2009, Pages 867-876

  Potamias, Michalis ^a   Bonchi, Francesco ^b   Castillo, Carlos ^b   Gionis, Aristides ^b  

^a BOSTON UNIVERSITY   (United States)

^b YAHOO RESEARCH   (Spain)

Author keywords

Graphs; Landmarks methods; Shortest paths

Indexed keywords

ACCURACY LOSS; DISTANCE ESTIMATION; EXACT METHODS; HEURISTIC SOLUTIONS; LANDMARK SELECTION; LARGE GRAPHS; LARGE NETWORKS; NP-HARD PROBLEM; OFFLINE; OPTIMAL SETS; ORDERS OF MAGNITUDE; REAL-WORLD GRAPHS; RUNTIMES; SHORTEST PATH; SIMPLE METHOD; SOCIAL SEARCH; THEORETICAL BOUNDS;

COMPUTATIONAL COMPLEXITY;

KNOWLEDGE MANAGEMENT;

EID: 74549131087     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1645953.1646063     Document Type: Conference Paper

References (38)

1. I. Abraham, Y. Bartal, H. Chan, K. Dhamdhere, A. Gupta, J. Kleinberg, O. Neiman, and A. Slivkins. Metric embeddings with relaxed guarantees. In FOCS 2005.
2. S. Amer-Yahia, M. Benedikt, L. V. Lakshmanan, and J. Stoyanovic. Efficient network-aware search in collaborative tagging sites. In VLDB 2008.
3. V. Athitsos, P. Papapetrou, M. Potamias, G. Kollios, and D. Gunopulos. Approximate embedding-based subsequence matching of time series. In SIGMOD 2008.
4. D. Bader, S. Kintali, K. Madduri, and M. Mihail. Approximating betweenness centrality. In WAW 2007.
5. Baeza and Ribeiro. Modern Information Retrieval. ACM Press / Addison-Wesley, 1999.
6. J. Bourgain. On Lipschitz embedding of finite metric spaces in Hilbert space. Israel Journal of Mathematics, 52(1):46-52, March 1985.
7. U. Brandes. A faster algorithm for betweenness centrality. Journal of Mathematical Sociology, 2001.
8. V. Chvatal. A greedy heuristic for the set-covering problem. Mathematics of Operations Research, 1979.
9. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, 2nd Edition. The MIT Press, 2001.
10. F. Dabek, R. Cox, F. Kaashoek, and R. Morris. Vivaldi: a decentralized network coordinate system. In SIGCOMM 2004.
11. E. W. Dijkstra. A note on two problems in connexion with graphs. Numerische Mathematik, 1959.
12. R. Fagin, A. Lotem, and M. Naor Optimal aggregation algorithms for middleware. J. Comput. Syst. Sci., 2003.
13. R. W. Floyd. Algorithm 97: Shortest path. Commun. ACM, 5(6), June 1962.
14. D. Fogaras, and B. Racz Towards Scaling Fully Personalized PageRank. Algorithms and Models for the Web-Graph, pp. 105-117, 2004.
15. L. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1):35-41, 1977.
16. A. Goldberg, H. Kaplan, and R. Werneck. Reach for A*: Efficient point-to-point shortest path algorithms. Tech. Rep. MSR-TR-2005-132, October 2005.
17. A. Goldberg and C. Harrelson. Computing the shortest path: A* search meets graph theory. In SODA 2005.
18. A. Goyal, F. Bonchi, and L. Lakshmanan. Discovering leaders from community actions. In CIKM 2008.
19. B. M. Hill. A simple general approach to inference about the tail of a distribution. Annals of Stat., 1975.
20. G. Hjaltason and H. Samet. Properties of embedding methods for similarity searching in metric spaces. IEEE Trans. Pattern Anal. Mach. Intel., 25(5):530-549, 2003.
21. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association 58(301):13-30, 1963.
22. T. Ikeda, M.-Y. Hsu, H. Imai, S. Nishimura, H. Shimoura, T. Hashimoto, K. Tenmoku, and K. Mitoh. A Fast Alogrithm for Finding Better Routes by AI Search Techniques. In IEEE Vehicle Navigation and Information Systems Conference, 1994.
23. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on Scientific Comp. 20(1):359-392, 1999.
24. J. Kleinberg, A. Slivkins, and T. Wexler. Triangulation and embedding using small sets of beacons. In FOCS 2004.
25. HP. Kriegel, P. Kroger, M. Renz, and T. Schmidt. Vivaldi: a decentralized network coordinate system. In SIGCOMM 2004.
26. E. Ng and H. Zhang. Predicting internet network distance with coordiantes-based approaches. In INFOCOM 2001.
27. I. Pohl. Bi-directional Search. In Machine Intelligence, vol. 6, Edinburgh University Press, 1971, pp. 127Ucombining double acute accent-140.
28. M. J. Rattigan, M. Maier, and D. Jensen. Using structure indices for efficient approximation of network properties. In KDD 2006.
29. H. Samet, J. Sankaranarayanan, and H. Alborzi. Scalable network distance browsing in spatial databases. In SIGMOD'08.
30. P. Singla and M. Richardson. Yes, there is a correlation: from social networks to personal behavior on the web. In WWW'08.
31. L. Tang and M. Crovella. Virtual landmarks for the internet. In IMC 2003.
32. M. Thorup and U. Zwick. Approximate distance oracles. In ACM Symp. on Theory of Computing, 2001.
33. H. Tong, C. Faloutsos and J-Y.Pan. Fast random walk with restart and its applications In ICDM, 2006.
34. A. Ukkonen, C. Castillo, D. Donato, and A. Gionis. Searching the wikipedia with contextual information. In CIKM, 2008.
35. J. Venkateswaran, D. Lachwani, T. Kahveci, and C. Jermaine. Reference-based indexing of sequence databases. In VLDB 2006.
36. M. V. Vieira, B. M. Fonseca, R. Damazio, P. B. Golgher, D. de Castro Reis, and B. Ribeiro-Neto. Efficient search ranking in social networks. In CIKM 2007.
37. Y. Xiao, W. Wu, J. Pei, W. Wang, and Z. He. Efficiently Indexing Shortest Paths by Exploiting Symmetry in Graphs. In EDBT 2009
38. U. Zwick. Exact and approximate distances in graphs - a survey. LNCS, 2161, 2001.