{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:26:04Z","timestamp":1750307164220,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":36,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,24]],"date-time":"2011-10-24T00:00:00Z","timestamp":1319414400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,10,24]]},"DOI":"10.1145\/2063576.2063833","type":"proceedings-article","created":{"date-parts":[[2011,11,16]],"date-time":"2011-11-16T10:40:21Z","timestamp":1321440021000},"page":"1775-1784","update-policy":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Skynets"],"prefix":"10.1145","author":[{"given":"Huiping","family":"Cao","sequence":"first","affiliation":[{"name":"New Mexico State University, Las Cruces, NM, USA"}]},{"given":"K. Sel\u00e7uk","family":"Candan","sequence":"additional","affiliation":[{"name":"Arizona State University, Tempe, AZ, USA"}]},{"given":"Maria Luisa","family":"Sapino","sequence":"additional","affiliation":[{"name":"Universita di Torino, Torino, Italy"}]}],"member":"320","published-online":{"date-parts":[[2011,10,24]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183614.1183674"},{"key":"e_1_3_2_1_2_1","first-page":"431","volume-title":"ICDE","author":"Hulgeri A.","year":"2002","unstructured":". Bhalotia, A. Hulgeri , C. Nakhe , S. Chakrabarti , and S. Sudarshan . Keyword searching and browsing in databases using BANKS . ICDE , pp. 431 -- 440 , 2002 . . Bhalotia, A. Hulgeri,C. Nakhe, S. Chakrabarti, and S. Sudarshan. Keyword searching and browsing in databases using BANKS. ICDE, pp. 431--440, 2002."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/645484.656550"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-008-0109-y"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2003.1260846"},{"key":"e_1_3_2_1_6_1","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001","unstructured":"T. H. Cormen , C. E. Leiserson , and R. L. Rivest . Introduction to Algorithms . MIT Press and McGraw-Hill , 2001 . T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press and McGraw-Hill, 2001."},{"key":"e_1_3_2_1_7_1","volume-title":"ICDE'07","author":"Zhou X.","year":"2007","unstructured":". Deng, X. Zhou , and H. T. Shen . Multi-source skyline query processing in road networks . ICDE'07 , 796--805, 2007 . . Deng, X. Zhou, and H. T. Shen. Multi-source skyline query processing in road networks. ICDE'07, 796--805, 2007."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1871437.1871625"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376708"},{"key":"e_1_3_2_1_10_1","first-page":"272","volume-title":"A genetic algorithm for Steiner tree optimization with multipleconstraints using Prufer number.LNCS,Vol.2510\/2002","author":"Haghighat A. T.","year":"2002","unstructured":"A. T. Haghighat , K. Faez , M. Dehghan , A. Mowlaei and Y. Ghahremani . A genetic algorithm for Steiner tree optimization with multipleconstraints using Prufer number.LNCS,Vol.2510\/2002 , pp. 272 -- 280 , 2002 . A. T. Haghighat, K. Faez, M. Dehghan, A. Mowlaei and Y. Ghahremani.A genetic algorithm for Steiner tree optimization with multipleconstraints using Prufer number.LNCS,Vol.2510\/2002, pp. 272--280, 2002."},{"key":"e_1_3_2_1_11_1","volume-title":"Lect. Notes Econ. Math. Syst.","volume":"117","year":"1979","unstructured":".Hansen. Bicriterion path problems . Lect. Notes Econ. Math. Syst. , Vol. 117 , 1979 . .Hansen. Bicriterion path problems. Lect. Notes Econ. Math. Syst., Vol.117, 1979."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247516"},{"key":"e_1_3_2_1_13_1","first-page":"670","author":"Hristidis V.","year":"2002","unstructured":"V. Hristidis and Y. Papakonstantinou . DISCOVER: Keyword search in relational databases. In VLDB , pp. 670 -- 681 , 2002 . V. Hristidis and Y. Papakonstantinou. DISCOVER: Keyword search in relational databases. In VLDB, pp. 670--681, 2002.","journal-title":"DISCOVER: Keyword search in relational databases. In VLDB"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/11427865_10"},{"key":"e_1_3_2_1_15_1","first-page":"1276","volume-title":"ICDE'07","author":"Ester M.","year":"2007","unstructured":". Jin, M. Ester , Z. Hu , and J. Han . Themulti-relational skyline operator . ICDE'07 ,pp. 1276 -- 1280 , 2007 . . Jin, M. Ester, Z. Hu, and J. Han. Themulti-relational skyline operator. ICDE'07,pp. 1276--1280, 2007."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1807167.1807183"},{"key":"e_1_3_2_1_17_1","first-page":"505","volume-title":"VLDB","author":"Pandit S.","year":"2005","unstructured":". Kacholia, S. Pandit , S. Chakrabarti , S. Sudarshan , R. Desai , and H. Karambelkar . Bidirectional expansion for keyword search on graph databases . In VLDB , pp. 505 -- 516 , 2005 . . Kacholia, S. Pandit,S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. In VLDB, pp. 505--516, 2005."},{"key":"e_1_3_2_1_18_1","first-page":"95","volume-title":"Euromath Bulletin","volume":"2","author":"Kearfott R.B.","year":"1996","unstructured":"R.B. Kearfott . Interval computations : Introduction, uses, and resources . Euromath Bulletin , vol. 2 , pp. 95 -- 112 . European Mathematical Trust , 1996 . R.B. Kearfott. Interval computations: Introduction, uses, and resources. Euromath Bulletin, vol. 2, pp. 95--112. European Mathematical Trust, 1996."},{"key":"e_1_3_2_1_19_1","first-page":"141","volume-title":"A fastalgorithm for steiner trees. Acta Informatica,15(2)","author":"Markowsky G.","year":"1981","unstructured":". Kou, G. Markowsky , and L. Berman . A fastalgorithm for steiner trees. Acta Informatica,15(2) . pp. 141 -- 145 , 1981 . . Kou, G. Markowsky, and L. Berman. A fastalgorithm for steiner trees. Acta Informatica,15(2). pp.141--145, 1981."},{"key":"e_1_3_2_1_20_1","first-page":"261","volume-title":"ICDE","author":"Kriegel P.","year":"2010","unstructured":".- P. Kriegel and M. Renz , and M. Schubert. Routeskyline queries: A multi-preference path planning approach . In ICDE , pp. 261 -- 272 , 2010 . .-P. Kriegel and M. Renz, and M. Schubert. Routeskyline queries: A multi-preference path planning approach. In ICDE, pp. 261--272, 2010."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/321906.321910"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372057"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247495"},{"key":"e_1_3_2_1_25_1","unstructured":"METIS. https:\/\/linproxy.fan.workers.dev:443\/http\/glaros.dtc.umn.edu\/gkhome\/metis\/metis\/overview.  METIS. https:\/\/linproxy.fan.workers.dev:443\/http\/glaros.dtc.umn.edu\/gkhome\/metis\/metis\/overview."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376661"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559917"},{"key":"e_1_3_2_1_28_1","first-page":"196","volume-title":"15th Int. Work. WG '89","author":"Reich G.","year":"1989","unstructured":"G. Reich and P. Widmayer . Beyond steiner's problem: A VLSI oriented generalization . In 15th Int. Work. WG '89 , pages 196 -- 210 , 1989 . G. Reich and P. Widmayer. Beyond steiner's problem: A VLSI oriented generalization. In 15th Int. Work. WG '89, pages 196--210, 1989."},{"key":"e_1_3_2_1_29_1","first-page":"770","volume-title":"SODA'00","author":"Robins G.","year":"2000","unstructured":"G. Robins , A. Zelikovsky . Improved Steiner tree approximation in graphs . in SODA'00 , pp. 770 -- 779 , 2000 . G. Robins, A. Zelikovsky. Improved Steiner tree approximation in graphs. in SODA'00, pp.770--779, 2000."},{"key":"e_1_3_2_1_30_1","first-page":"176","volume-title":"ICDEW'08","author":"Wu S.","year":"2008","unstructured":". Sun, S. Wu , J. Li , and A. K. H. Tung . Skyline-join in distributed databases . In ICDEW'08 ,pp. 176 -- 181 , 2008 . . Sun, S. Wu, J. Li, and A. K. H. Tung. Skyline-join in distributed databases. In ICDEW'08,pp. 176--181, 2008."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10700-005-4916-y"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1142\/S021848850200165X"},{"key":"e_1_3_2_1_33_1","first-page":"301","volume-title":"VLDB'01","author":"Tan K. L.","year":"2001","unstructured":"K. L. Tan , P. K. Eng , and B. C. Ooi . Efficient progressive skyline computation . In VLDB'01 , pages 301 -- 310 , 2001 . K. L. Tan, P. K. Eng, andB. C. Ooi. Efficient progressive skyline computation. In VLDB'01, pages 301--310, 2001."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.2478\/v10006-007-0023-2"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1287\/opre.35.1.70"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1942776.1942785"},{"key":"e_1_3_2_1_37_1","volume-title":"Better approximation bounds for the network and Euclidean Steiner treeproblems. Technical report CS-96-06","author":"Zelikovsky A.","year":"1996","unstructured":"A. Zelikovsky . Better approximation bounds for the network and Euclidean Steiner treeproblems. Technical report CS-96-06 , University of Virginia , 1996 . A. Zelikovsky. Better approximation bounds for the network and Euclidean Steiner treeproblems. Technical report CS-96-06, University of Virginia, 1996."}],"event":{"name":"CIKM '11: International Conference on Information and Knowledge Management","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Glasgow Scotland, UK","acronym":"CIKM '11"},"container-title":["Proceedings of the 20th ACM international conference on Information and knowledge management"],"original-title":[],"link":[{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2063576.2063833","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/pdf\/10.1145\/2063576.2063833","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:54:36Z","timestamp":1750240476000},"score":1,"resource":{"primary":{"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/dl.acm.org\/doi\/10.1145\/2063576.2063833"}},"subtitle":["searching for minimum trees in graphs with incomparable edge weights"],"short-title":[],"issued":{"date-parts":[[2011,10,24]]},"references-count":36,"alternative-id":["10.1145\/2063576.2063833","10.1145\/2063576"],"URL":"https:\/\/linproxy.fan.workers.dev:443\/https\/doi.org\/10.1145\/2063576.2063833","relation":{},"subject":[],"published":{"date-parts":[[2011,10,24]]},"assertion":[{"value":"2011-10-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}