{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T05:35:18Z","timestamp":1768109718127,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":32,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,6,14]],"date-time":"2016-06-14T00:00:00Z","timestamp":1465862400000},"content-version":"vor","delay-in-days":0,"URL":"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":[[2016,6,14]]},"DOI":"10.1145\/2882903.2915217","type":"proceedings-article","created":{"date-parts":[[2016,6,16]],"date-time":"2016-06-16T19:01:52Z","timestamp":1466103712000},"page":"91-106","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Efficient and Progressive Group Steiner Tree Search"],"prefix":"10.1145","author":[{"given":"Rong-Hua","family":"Li","sequence":"first","affiliation":[{"name":"Shenzhen University, Shenzhen, China"}]},{"given":"Lu","family":"Qin","sequence":"additional","affiliation":[{"name":"University of Technology, Sydney, Sydney, Australia"}]},{"given":"Jeffrey Xu","family":"Yu","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}]},{"given":"Rui","family":"Mao","sequence":"additional","affiliation":[{"name":"Shenzhen University, Shenzhen, China"}]}],"member":"320","published-online":{"date-parts":[[2016,6,14]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2582112.2582156"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2187836.2187950"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/876875.879034"},{"key":"e_1_3_2_1_4_1","volume-title":"SDM","author":"B\u00f6hm C.","year":"2013","unstructured":"C. B\u00f6hm , J. Feng , X. He , and S. T. Mai . Efficient anytime density-based clustering . In SDM , 2013 . C. B\u00f6hm, J. Feng, X. He, and S. T. Mai. Efficient anytime density-based clustering. In SDM, 2013."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276719"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2012.228"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3828.3830"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2007.367929"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230010302"},{"key":"e_1_3_2_1_10_1","volume-title":"AAAI","author":"Esmeir S.","year":"2006","unstructured":"S. Esmeir and S. Markovitch . Anytime induction of decision trees: An iterative improvement approach . In AAAI , 2006 . S. Esmeir and S. Markovitch. Anytime induction of decision trees: An iterative improvement approach. In AAAI, 2006."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2000.1096"},{"key":"e_1_3_2_1_14_1","volume-title":"SODA","author":"Goldberg A. V.","year":"2005","unstructured":"A. V. Goldberg and C. Harrelson . Computing the shortest path: A* search meets graph theory . In SODA , 2005 . A. V. Goldberg and C. Harrelson. Computing the shortest path: A* search meets graph theory. In SODA, 2005."},{"key":"e_1_3_2_1_15_1","volume-title":"Anytime heuristic search. J. Artif. Intell. Res. (JAIR), 28:267--297","author":"Hansen E. A.","year":"2007","unstructured":"E. A. Hansen and R. Zhou . Anytime heuristic search. J. Artif. Intell. Res. (JAIR), 28:267--297 , 2007 . E. A. Hansen and R. Zhou. Anytime heuristic search. J. Artif. Intell. Res. (JAIR), 28:267--297, 2007."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSSC.1968.300136"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247516"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/647672.731318"},{"key":"e_1_3_2_1_19_1","volume-title":"VLDB","author":"Kacholia V.","year":"2005","unstructured":"V. Kacholia , S. Pandit , S. Chakrabarti , S. Sudarshan , R. Desai , and H. Karambelkar . Bidirectional expansion for keyword search on graph databases . In VLDB , 2005 . V. Kacholia, S. Pandit, S. Chakrabarti, S. Sudarshan, R. Desai, and H. Karambelkar. Bidirectional expansion for keyword search on graph databases. In VLDB, 2005."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.64"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1142351.1142377"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557074"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2009.06.025"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.196"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339690"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(84)90003-1"},{"key":"e_1_3_2_1_27_1","volume-title":"IJCAI","author":"Mouaddib A.","year":"1995","unstructured":"A. Mouaddib and S. Zilberstein . Knowledge-based anytime computation . In IJCAI , 1995 . A. Mouaddib and S. Zilberstein. Knowledge-based anytime computation. In IJCAI, 1995."},{"key":"e_1_3_2_1_28_1","volume-title":"15th International Workshop,WG","author":"Reich G.","year":"1989","unstructured":"G. Reich and P. Widmayer . Beyond steiner's problem: A VLSI oriented generalization . In 15th International Workshop,WG , 1989 . G. Reich and P. Widmayer. Beyond steiner's problem: A VLSI oriented generalization. In 15th International Workshop,WG, 1989."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2006.21"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-18120-2_23"},{"key":"e_1_3_2_1_31_1","volume-title":"VLDB","author":"Zhang D.","year":"2006","unstructured":"D. Zhang , Y. Du , T. Xia , and Y. Tao . Progressive computation of the min-dist optimal-location query . In VLDB , 2006 . D. Zhang, Y. Du, T. Xia, and Y. Tao. Progressive computation of the min-dist optimal-location query. In VLDB, 2006."},{"issue":"3","key":"e_1_3_2_1_32_1","first-page":"73","article-title":"Using anytime algorithms in intelligent systems","volume":"17","author":"Zilberstein S.","year":"1996","unstructured":"S. Zilberstein . Using anytime algorithms in intelligent systems . AI Magazine , 17 ( 3 ): 73 -- 83 , 1996 . S. Zilberstein. Using anytime algorithms in intelligent systems. AI Magazine, 17(3):73--83, 1996.","journal-title":"AI Magazine"}],"event":{"name":"SIGMOD\/PODS'16: International Conference on Management of Data","location":"San Francisco California USA","acronym":"SIGMOD\/PODS'16","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2016 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2882903.2915217","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2882903.2915217","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:55:05Z","timestamp":1750222505000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2882903.2915217"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,6,14]]},"references-count":32,"alternative-id":["10.1145\/2882903.2915217","10.1145\/2882903"],"URL":"https:\/\/doi.org\/10.1145\/2882903.2915217","relation":{},"subject":[],"published":{"date-parts":[[2016,6,14]]},"assertion":[{"value":"2016-06-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}