1 |
Pandurangan, G., P. Raghavan, and E. Upfal, "Using PageRank to Characterize web Structure," Proc. COCOON, (2002), pp.330-339.
|
2 |
Pinto, L.L. and G. Laporte, "An efficient algorithm for the Steiner Tree Problem with revenue, bottleneck and hop objective functions," European Journal of Operational Research, Vol.207, No.1(2010), pp.45-49.
DOI
ScienceOn
|
3 |
Rothlauf, F., "On Optimal Solutions for the Optimal Communication Spanning Tree Problem," Operations Research, Vol.57, No.2 (2009), pp.413-425.
DOI
|
4 |
Whittaker, G., R. Confesor Jr., S.M. Griffith, R. Fare, S. Grosskopf, J.J. Steiner, G.W. Mueller-Warrant, and G.M. Banowetz "A hybrid genetic algorithm for multiobjective problems with activity analysis-based local search," European Journal of Operational Research, Vol.193, No.1(2009), pp.195-203.
DOI
ScienceOn
|
5 |
Lee, W.J., J.-H. Lee, Y. Kim, C.K-S. Leung, "AnchorWoman : top-k structured mobile web search engine," CIKM, (2009), pp.2089-2090.
|
6 |
Lee, W., J. Song, J. Baek, and J. Lee., "Steiner Tree based Effective Mobile Web Search," Proc. KORMS Conference, 2010.
|
7 |
Li, W., K. Candan, Q. Vu, and D. Agrawal, "Retrieving and Organizing Web Pages by Information Unit," In Proc. WWW, (2001), pp.230-244.
|
8 |
Maserrat, H. and J. Pei, "Neighbor query friendly compression of social networks," KDD, (2010), pp.533-542.
|
9 |
Kleinberg, J.M., A. Slivkins, and T. Wexler, "Triangulation and embedding using small sets of beacons," J. ACM, Vol.56, No.6(2009).
|
10 |
Lee, W., K.S. Carson, J. Leung, J.H. Lee, "Mobile Web Navigation in Digital Ecosystems Using Rooted Directed Trees," IEEE TIE, 2011(in-print).
|
11 |
Kleinberg, J.M. and S. Lawrence, "The Structure of the Web," Science, Vol.294 (2001), p.1849.
DOI
|
12 |
Fagin, R., A. Lotem, and M. Naor, "Optimal aggregation algorithms for middleware," PODS, (2001), pp.102-113.
|
13 |
Amer-Yahia, S., A. Doan, J.M. Kleinberg, N. Koudas, and M. Franklin, "Crowds, clouds, and algorithms : exploring the human side of 'big data' applications," SIGMOD, (2010), pp.1259-1260.
|
14 |
Byrka, J., F. Grandoni, T. Rothvob, and L. Sanita, "An improved LP-based approximation for steiner tree," STOC, (2010), pp.583-592.
|
15 |
Consoli, S., K. Darby-Dowman, N. Mladenovic, and J.A. Moreno-Perez, "Variable neighbourhood search for the minimum labelling Steiner tree problem," Annals OR, Vol. 172, No.1(2009), pp.71-96.
DOI
ScienceOn
|
16 |
Fagin, R., "Combining Fuzzy Information from Multiple Systems," PODS, (1996), pp.216-226.
|
17 |
Glover, E.J., D.M. Pennock, S. Lawrence, and R. Krovetz, "Inferring Hierarchical Descriptions," Proc. CIKM, (2002), pp.507-514.
|
18 |
Gouveia, L. and J. Telhada, "The multiweighted Steiner tree problem : A reformulation by intersection," Computers and OR, Vol.35, No.11(2008), pp.3599-3611.
DOI
ScienceOn
|
19 |
Gouveia, L., P. Moura, and A. Sousa, "Prize collecting Steiner trees with node degree dependent costs," Computers and OR, Vol.38, No.1(2011), pp.234-245.
DOI
ScienceOn
|
20 |
Guoliang, L., O.C. Beng, F. Jianhua, W. Jianyong, and Z. Lizhu, "EASE : an effective 3- in-1 keyword search method for unstructured, semi-structured and structured data," In Proc. SIGMOD, (2008), pp.903-914.
|
21 |
Gupta, A. and A. Kumar, "A constant-factor approximation for stochastic Steiner forest. STOC," (2009), pp.659-668.
|
22 |
Hammami, M.Y. Chahir, and L. Chen, "Web-Guard : A Web Filtering Engine Combining Textual, Structural, and Visual Content-Based Analysis," IEEE TKDE, Vol.18, No.2 (2006), pp.272-284.
|
23 |
Kasneci, G., M. Ramanath, M. Sozio, F. M. Suchanek, and G. Weikum, "STAR : Steiner-Tree Approximation in Relationship Graphs," In Proc. ICDE, (2009), pp.868-879.
|
24 |
Akbarinia, R., E. Pacitti, and P. Valduriez, "Best Position Algorithms for Top-k Queries," VLDB, (2007), pp.495-506.
|