{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T06:07:23Z","timestamp":1761631643082,"version":"build-2065373602"},"reference-count":79,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T00:00:00Z","timestamp":1761609600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Front. Comput. Sci."],"published-print":{"date-parts":[[2026,3]]},"DOI":"10.1007\/s11704-025-41427-9","type":"journal-article","created":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T05:15:55Z","timestamp":1761628555000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Budgeted spatial data acquisition: when coverage and connectivity matter"],"prefix":"10.1007","volume":"20","author":[{"given":"Wenzhe","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shixun","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiyong","family":"Peng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,10,28]]},"reference":[{"issue":"1","key":"41427_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/s00778-019-00564-x","volume":"29","author":"A Chapman","year":"2020","unstructured":"Chapman A, Simperl E, Koesten L, Konstantinidis G, Ib\u00e1\u00f1ez L D, Kacprzak E, Groth P. Dataset search: a survey. The VLDB Journal, 2020, 29(1): 251\u2013272","journal-title":"The VLDB Journal"},{"issue":"12","key":"41427_CR2","doi-asserted-by":"publisher","first-page":"1933","DOI":"10.14778\/3407790.3407800","volume":"13","author":"R C Fernandez","year":"2020","unstructured":"Fernandez R C, Subramaniam P, Franklin M J. Data market platforms: Trading data assets to solve data problems. Proceedings of the VLDB Endowment, 2020, 13(12): 1933\u20131947","journal-title":"Proceedings of the VLDB Endowment"},{"key":"41427_CR3","first-page":"819","volume-title":"Proceedings of the 26th International Conference on Extending Database Technology","author":"A Ionescu","year":"2023","unstructured":"Ionescu A, Alexandridou A, Ikonomou L, Psarakis K, Patroumpas K, Chatzigeorgakidis G, Skoutas D, Athanasiou S, Hai R, Katsifodimos A. Topio marketplace: Search and discovery of geospatial data. In: Proceedings of the 26th International Conference on Extending Database Technology. 2023, 819\u2013822"},{"key":"41427_CR4","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1145\/3448016.3457247","volume-title":"Proceedings of 2021 International Conference on Management of Data","author":"S Wang","year":"2021","unstructured":"Wang S, Sun Y, Musco C, Bao Z. Public transport planning: When transit network connectivity meets commuting demand. In: Proceedings of 2021 International Conference on Management of Data. 2021, 1906\u20131919"},{"issue":"4","key":"41427_CR5","doi-asserted-by":"publisher","first-page":"757","DOI":"10.1109\/TKDE.2017.2776268","volume":"30","author":"S Wang","year":"2018","unstructured":"Wang S, Bao Z, Culpepper J S, Sellis T, Cong G. Reverse k nearest neighbor search over trajectories. IEEE Transactions on Knowledge and Data Engineering, 2018, 30(4): 757\u2013771","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"7","key":"41427_CR6","doi-asserted-by":"publisher","first-page":"979","DOI":"10.14778\/3384345.3384348","volume":"13","author":"J Wang","year":"2020","unstructured":"Wang J, Cheng P, Zheng L, Feng C, Chen L, Lin X, Wang Z. Demand-aware route planning for shared mobility services. Proceedings of the VLDB Endowment, 2020, 13(7): 979\u2013991","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"3","key":"41427_CR7","doi-asserted-by":"publisher","first-page":"197","DOI":"10.14778\/3291264.3291266","volume":"12","author":"M E Ali","year":"2018","unstructured":"Ali M E, Eusuf S S, Abdullah K, Choudhury F M, Culpepper J S, Sellis T. The maximum trajectory coverage query in spatial databases. Proceedings of the VLDB Endowment, 2018, 12(3): 197\u2013209","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"12","key":"41427_CR8","doi-asserted-by":"publisher","first-page":"24031","DOI":"10.1109\/TITS.2022.3207499","volume":"23","author":"D He","year":"2022","unstructured":"He D, Zhou T, Zhou X, Kim J. An efficient algorithm for maximum trajectory coverage query with approximation guarantee. IEEE Transactions on Intelligent Transportation Systems, 2022, 23(12): 24031\u201324043","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"issue":"6","key":"41427_CR9","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5","volume":"45","author":"D S Hochbaum","year":"1998","unstructured":"Hochbaum D S, Pathria A. Analysis of the greedy approach in problems of maximum k-coverage. Naval Research Logistics, 1998, 45(6): 615\u2013627","journal-title":"Naval Research Logistics"},{"issue":"4","key":"41427_CR10","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige U. A threshold of ln n for approximating set cover. Journal of the ACM, 1998, 45(4): 634\u2013652","journal-title":"Journal of the ACM"},{"issue":"1","key":"41427_CR11","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1145\/2481528.2481532","volume":"42","author":"F Schomm","year":"2013","unstructured":"Schomm F, Stahl F, Vossen G. Marketplaces for data: an initial survey. ACM SIGMOD Record, 2013, 42(1): 15\u201326","journal-title":"ACM SIGMOD Record"},{"issue":"12","key":"41427_CR12","doi-asserted-by":"publisher","first-page":"1482","DOI":"10.14778\/3402755.3402801","volume":"4","author":"M Balazinska","year":"2011","unstructured":"Balazinska M, Howe B, Suciu D. Data markets in the cloud: An opportunity for the database community. Proceedings of the VLDB Endowment, 2011, 4(12): 1482\u20131485","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"4","key":"41427_CR13","doi-asserted-by":"publisher","first-page":"362","DOI":"10.14778\/3297753.3297757","volume":"12","author":"Y Li","year":"2018","unstructured":"Li Y, Sun H, Dong B, Wang H. Cost-efficient data acquisition on online data marketplaces for correlation analysis. Proceedings of the VLDB Endowment, 2018, 12(4): 362\u2013375","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"12","key":"41427_CR14","doi-asserted-by":"publisher","first-page":"4106","DOI":"10.14778\/3611540.3611632","volume":"16","author":"S Qiao","year":"2023","unstructured":"Qiao S, Jindal A. PikePlace: Generating intelligence for marketplace datasets. Proceedings of the VLDB Endowment, 2023, 16(12): 4106\u20134109","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"11","key":"41427_CR15","doi-asserted-by":"publisher","first-page":"3137","DOI":"10.14778\/3551793.3551858","volume":"15","author":"A Asudeh","year":"2022","unstructured":"Asudeh A, Nargesian F. Towards distribution-aware query answering in data markets. Proceedings of the VLDB Endowment, 2022, 15(11): 3137\u20133144","journal-title":"Proceedings of the VLDB Endowment"},{"key":"41427_CR16","first-page":"10","volume-title":"Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems","author":"Y Kanza","year":"2015","unstructured":"Kanza Y, Samet H. An online marketplace for geosocial data. In: Proceedings of the 23rd SIGSPATIAL International Conference on Advances in Geographic Information Systems. 2015, 10"},{"key":"41427_CR17","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver A. Combinatorial Optimization: Polyhedra and Efficiency. Berlin: Springer, 2003"},{"key":"41427_CR18","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C H Papadimitriou","year":"1998","unstructured":"Papadimitriou C H, Steiglitz K. Combinatorial Optimization: Algorithms and Complexity. North Chelmsford: Courier Corporation, 1998"},{"key":"41427_CR19","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1145\/3328526.3329589","volume-title":"Proceedings of 2019 ACM Conference on Economics and Computation","author":"A Agarwal","year":"2019","unstructured":"Agarwal A, Dahleh M, Sarkar T. A marketplace for data: an algorithmic solution. In: Proceedings of 2019 ACM Conference on Economics and Computation. 2019, 701\u2013726"},{"key":"41427_CR20","first-page":"3","volume-title":"Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation","author":"D Moor","year":"2019","unstructured":"Moor D. Data markets with dynamic arrival of buyers and sellers. In: Proceedings of the 14th Workshop on the Economics of Networks, Systems and Computation. 2019, 3"},{"issue":"4","key":"41427_CR21","first-page":"1928","volume":"34","author":"C Niu","year":"2022","unstructured":"Niu C, Zheng Z, Wu F, Tang S, Chen G. Online pricing with reserve price constraint for personal data markets. IEEE Transactions on Knowledge and Data Engineering, 2022, 34(4): 1928\u20131943","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"41427_CR22","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/2463676.2465335","volume-title":"Proceedings of 2013 ACM SIGMOD International Conference on Management of Data","author":"P Koutris","year":"2013","unstructured":"Koutris P, Upadhyaya P, Balazinska M, Howe B, Suciu D. Toward practical query pricing with QueryMarket. In: Proceedings of 2013 ACM SIGMOD International Conference on Management of Data. 2013, 613\u2013624"},{"issue":"4","key":"41427_CR23","doi-asserted-by":"publisher","first-page":"1038","DOI":"10.1109\/TBDATA.2023.3254152","volume":"9","author":"M Zhang","year":"2023","unstructured":"Zhang M, Beltr\u00e1n F, Liu J. A survey of data pricing for data marketplaces. IEEE Transactions on Big Data, 2023, 9(4): 1038\u20131056","journal-title":"IEEE Transactions on Big Data"},{"issue":"1","key":"41427_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.14778\/3357377.3357378","volume":"13","author":"S Chawla","year":"2019","unstructured":"Chawla S, Deep S, Koutrisw P, Teng Y. Revenue maximization for query pricing. Proceedings of the VLDB Endowment, 2019, 13(1): 1\u201314","journal-title":"Proceedings of the VLDB Endowment"},{"key":"41427_CR25","doi-asserted-by":"publisher","first-page":"1535","DOI":"10.1145\/3299869.3300078","volume-title":"Proceedings of 2019 International Conference on Management of Data","author":"L Chen","year":"2019","unstructured":"Chen L, Koutris P, Kumar A. Towards model-based pricing for machine learning in a data marketplace. In: Proceedings of 2019 International Conference on Management of Data. 2019, 1535\u20131552"},{"issue":"9","key":"41427_CR26","doi-asserted-by":"publisher","first-page":"757","DOI":"10.14778\/2732939.2732948","volume":"7","author":"B R Lin","year":"2014","unstructured":"Lin B R, Kifer D. On arbitrage-free pricing for general data queries. Proceedings of the VLDB Endowment, 2014, 7(9): 757\u2013768","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"10","key":"41427_CR27","doi-asserted-by":"publisher","first-page":"1832","DOI":"10.14778\/3467861.3467872","volume":"14","author":"Y Li","year":"2021","unstructured":"Li Y, Yu X, Koudas N. Data acquisition for improving machine learning models. Proceedings of the VLDB Endowment, 2021, 14(10): 1832\u20131844","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"11","key":"41427_CR28","doi-asserted-by":"publisher","first-page":"2140","DOI":"10.1080\/13658816.2018.1484124","volume":"32","author":"M Sakr","year":"2018","unstructured":"Sakr M. A data model and algorithms for a spatial data marketplace. International Journal of Geographical Information Science, 2018, 32(11): 2140\u20132168","journal-title":"International Journal of Geographical Information Science"},{"issue":"3","key":"41427_CR29","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/3572751.3572755","volume":"51","author":"S A Azcoitia","year":"2022","unstructured":"Azcoitia S A, Laoutaris N. A survey of data marketplaces and their business models. ACM SIGMOD Record, 2022, 51(3): 18\u201329","journal-title":"ACM SIGMOD Record"},{"issue":"12","key":"41427_CR30","doi-asserted-by":"publisher","first-page":"3872","DOI":"10.14778\/3611540.3611573","volume":"16","author":"J Pei","year":"2023","unstructured":"Pei J, Fernandez R C, Yu X. Data and AI model markets: Opportunities for data and model sharing, discovery, and integration. Proceedings of the VLDB Endowment, 2023, 16(12): 3872\u20133873","journal-title":"Proceedings of the VLDB Endowment"},{"key":"41427_CR31","first-page":"1573","volume-title":"Proceedings of the 38th International Conference on Data Engineering","author":"C Chen","year":"2022","unstructured":"Chen C, Yuan Y, Wen Z, Wang G, Li A. GQP: a framework for scalable and effective graph query-based pricing. In: Proceedings of the 38th International Conference on Data Engineering. 2022, 1573\u20131585"},{"key":"41427_CR32","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1145\/3183713.3196929","volume-title":"Proceedings of 2018 International Conference on Management of Data","author":"Y Tong","year":"2018","unstructured":"Tong Y, Wang L, Zhou Z, Chen L, Du B, Ye J. Dynamic pricing in spatial crowdsourcing: A matching-based approach. In: Proceedings of 2018 International Conference on Management of Data. 2018, 773\u2013788"},{"key":"41427_CR33","doi-asserted-by":"publisher","first-page":"3553","DOI":"10.1145\/3394486.3406473","volume-title":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining","author":"J Pei","year":"2020","unstructured":"Pei J. Data pricing \u2014 from economics to data science. In: Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining. 2020, 3553\u20133554"},{"issue":"10","key":"41427_CR34","doi-asserted-by":"publisher","first-page":"4586","DOI":"10.1109\/TKDE.2020.3045927","volume":"34","author":"J Pei","year":"2022","unstructured":"Pei J. A survey on data pricing: from economics to data science. IEEE Transactions on Knowledge and Data Engineering, 2022, 34(10): 4586\u20134608","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"41427_CR35","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1145\/2213556.2213582","volume-title":"Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems","author":"P Koutris","year":"2012","unstructured":"Koutris P, Upadhyaya P, Balazinska M, Howe B, Suciu D. Query-based data pricing. In: Proceedings of the 31st ACM SIGMOD-SIGACT-SIGAI symposium on Principles of Database Systems. 2012, 167\u2013178"},{"key":"41427_CR36","doi-asserted-by":"publisher","first-page":"699","DOI":"10.1145\/3035918.3064017","volume-title":"Proceedings of 2017 ACM International Conference on Management of Data","author":"S Deep","year":"2017","unstructured":"Deep S, Koutris P. QIRANA: A framework for scalable query pricing. In: Proceedings of 2017 ACM International Conference on Management of Data. 2017, 699\u2013713"},{"key":"41427_CR37","unstructured":"Liu J. Dealer: End-to-end data marketplace with model-based pricing. 2020, arXiv preprint arXiv: 2003.13103"},{"issue":"8","key":"41427_CR38","doi-asserted-by":"publisher","first-page":"4024","DOI":"10.1109\/TKDE.2020.3026031","volume":"34","author":"X Miao","year":"2022","unstructured":"Miao X, Gao Y, Chen L, Peng H, Yin J, Li Q. Towards query pricing on incomplete data. IEEE Transactions on Knowledge and Data Engineering, 2022, 34(8): 4024\u20134036","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"41427_CR39","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.cie.2017.08.008","volume":"112","author":"H Yu","year":"2017","unstructured":"Yu H, Zhang M. Data pricing strategy based on data quality. Computers & Industrial Engineering, 2017, 112: 1\u201310","journal-title":"Computers & Industrial Engineering"},{"key":"41427_CR40","first-page":"3718","volume-title":"Proceedings of the 39th International Conference on Data Engineering","author":"S A Azcoitia","year":"2023","unstructured":"Azcoitia S A, Iordanou C, Laoutaris N. Understanding the price of data in commercial data marketplaces. In: Proceedings of the 39th International Conference on Data Engineering. 2023, 3718\u20133728"},{"key":"41427_CR41","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1145\/3219166.3219195","volume":"2018","author":"Y Chen","year":"2018","unstructured":"Chen Y, Immorlica N, Lucier B, Syrgkanis V, Ziani J. Optimal data acquisition for statistical estimation. In: Proceedings of 2018 ACM Conference on Economics and Computation, 2018, 2018: 27\u201344","journal-title":"Proceedings of 2018 ACM Conference on Economics and Computation"},{"issue":"1","key":"41427_CR42","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1145\/3588934","volume":"1","author":"S Huang","year":"2023","unstructured":"Huang S, Gan J, Bao Z, Lin W. Managing conflicting interests of stakeholders in influencer marketing. Proceedings of the ACM on Management of Data, 2023, 1(1): 80","journal-title":"Proceedings of the ACM on Management of Data"},{"issue":"10","key":"41427_CR43","doi-asserted-by":"publisher","first-page":"1852","DOI":"10.1109\/TKDE.2018.2807843","volume":"30","author":"Y Li","year":"2018","unstructured":"Li Y, Fan J, Wang Y, Tan K L. Influence maximization on social graphs: A survey. IEEE Transactions on Knowledge and Data Engineering, 2018, 30(10): 1852\u20131872","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"9","key":"41427_CR44","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.14778\/3397230.3397244","volume":"13","author":"S Bian","year":"2020","unstructured":"Bian S, Guo Q, Wang S, Yu J X. Efficient algorithms for budgeted influence maximization on massive social networks. Proceedings of the VLDB Endowment, 2020, 13(9): 1498\u20131510","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"2","key":"41427_CR45","doi-asserted-by":"publisher","first-page":"180","DOI":"10.14778\/3565816.3565821","volume":"16","author":"S Huang","year":"2022","unstructured":"Huang S, Lin W, Bao Z, Sun J. Influence maximization in real-world closed social networks. Proceedings of the VLDB Endowment, 2022, 16(2): 180\u2013192","journal-title":"Proceedings of the VLDB Endowment"},{"key":"41427_CR46","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1145\/956750.956769","volume-title":"Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"D Kempe","year":"2003","unstructured":"Kempe D, Kleinberg J, Tardos \u00c9. Maximizing the spread of influence through a social network. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2003, 137\u2013146"},{"key":"41427_CR47","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1145\/2588555.2593670","volume-title":"Proceedings of 2014 ACM SIGMOD International Conference on Management of Data","author":"Y Tang","year":"2014","unstructured":"Tang Y, Xiao X, Shi Y. Influence maximization: near-optimal time complexity meets practical efficiency. In: Proceedings of 2014 ACM SIGMOD International Conference on Management of Data. 2014, 75\u201386"},{"issue":"6","key":"41427_CR48","doi-asserted-by":"publisher","first-page":"1385","DOI":"10.1007\/s00778-020-00615-8","volume":"29","author":"K Huang","year":"2020","unstructured":"Huang K, Tang J, Han K, Xiao X, Chen W, Sun A, Tang X, Lim A. Efficient approximation algorithms for adaptive influence maximization. The VLDB Journal, 2020, 29(6): 1385\u20131406","journal-title":"The VLDB Journal"},{"issue":"1","key":"41427_CR49","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/s00778-014-0366-x","volume":"24","author":"H Li","year":"2015","unstructured":"Li H, Bhowmick S S, Sun A, Cui J. Conformity-aware influence maximization in online social networks. The VLDB Journal, 2015, 24(1): 117\u2013141","journal-title":"The VLDB Journal"},{"issue":"1","key":"41427_CR50","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/18M1212094","volume":"34","author":"S Khuller","year":"2020","unstructured":"Khuller S, Purohit M, Sarpatwar K K. Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems. SIAM Journal on Discrete Mathematics, 2020, 34(1): 251\u2013270","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"3","key":"41427_CR51","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1145\/990308.990309","volume":"51","author":"J Alber","year":"2004","unstructured":"Alber J, Fellows M R, Niedermeier R. Polynomial-time data reduction for dominating set. Journal of the ACM, 2004, 51(3): 363\u2013384","journal-title":"Journal of the ACM"},{"issue":"4","key":"41427_CR52","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha S, Khuller S. Approximation algorithms for connected dominating sets. Algorithmica, 1998, 20(4): 374\u2013387","journal-title":"Algorithmica"},{"key":"41427_CR53","first-page":"1597","volume-title":"Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies","author":"P J Wan","year":"2002","unstructured":"Wan P J, Alzoubi K M, Frieder O. Distributed construction of connected dominating set in wireless ad hoc networks. In: Proceedings of the 21st Annual Joint Conference of the IEEE Computer and Communications Societies. 2002, 1597\u20131604"},{"issue":"7","key":"41427_CR54","doi-asserted-by":"publisher","first-page":"848","DOI":"10.1016\/j.jpdc.2007.04.003","volume":"67","author":"R Gandhi","year":"2007","unstructured":"Gandhi R, Parthasarathy S. Distributed algorithms for connected domination in wireless networks. Journal of Parallel and Distributed Computing, 2007, 67(7): 848\u2013862","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"41427_CR55","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-5242-3","volume-title":"Connected Dominating Set: Theory and Applications","author":"D Z Du","year":"2013","unstructured":"Du D Z, Wan P J. Connected Dominating Set: Theory and Applications. New York: Springer, 2013"},{"issue":"2","key":"41427_CR56","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s00778-009-0162-1","volume":"19","author":"W Zhang","year":"2010","unstructured":"Zhang W, Lin X, Zhang Y, Pei J, Wang W. Threshold-based probabilistic top-k dominating queries. The VLDB Journal, 2010, 19(2): 283\u2013305","journal-title":"The VLDB Journal"},{"key":"41427_CR57","first-page":"72","volume-title":"Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation","author":"C Chekuri","year":"2004","unstructured":"Chekuri C, Kumar A. Maximum coverage problem with group budget constraints and applications. In: Proceedings of the 7th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2004 and 8th International Workshop on Randomization and Computation. 2004, 72\u201383"},{"issue":"9","key":"41427_CR58","doi-asserted-by":"publisher","first-page":"2989","DOI":"10.1007\/s00453-021-00850-7","volume":"83","author":"D Rawitz","year":"2021","unstructured":"Rawitz D, Ros\u00e9n A. Online budgeted maximum coverage. Algorithmica, 2021, 83(9): 2989\u20133014","journal-title":"Algorithmica"},{"key":"41427_CR59","doi-asserted-by":"publisher","first-page":"105940","DOI":"10.1016\/j.ipl.2020.105940","volume":"158","author":"D S Hochbaum","year":"2020","unstructured":"Hochbaum D S, Rao X. Approximation algorithms for connected maximum coverage problem for the discovery of mutated driver pathways in cancer. Information Processing Letters, 2020, 158: 105940","journal-title":"Information Processing Letters"},{"issue":"3","key":"41427_CR60","doi-asserted-by":"publisher","first-page":"725","DOI":"10.1007\/s10878-016-0102-0","volume":"34","author":"B Farbstein","year":"2017","unstructured":"Farbstein B, Levin A. Maximum coverage problem with group budget constraints. Journal of Combinatorial Optimization, 2017, 34(3): 725\u2013735","journal-title":"Journal of Combinatorial Optimization"},{"key":"41427_CR61","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.tcs.2019.02.015","volume":"788","author":"L Guo","year":"2019","unstructured":"Guo L, Li M, Xu D. Efficient approximation algorithms for maximum coverage with group budget constraints. Theoretical Computer Science, 2019, 788: 53\u201365","journal-title":"Theoretical Computer Science"},{"key":"41427_CR62","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1145\/3294052.3319691","volume-title":"Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems","author":"P Indyk","year":"2019","unstructured":"Indyk P, Vakilian A. Tight trade-offs for the maximum k-coverage problem in the general streaming model. In: Proceedings of the 38th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems. 2019, 200\u2013217"},{"key":"41427_CR63","first-page":"7620","volume-title":"Proceedings of the 37th International Conference on Machine Learning","author":"P Perrault","year":"2020","unstructured":"Perrault P, Healey J, Wen Z, Valko M. Budgeted online influence maximization. In: Proceedings of the 37th International Conference on Machine Learning. 2020, 7620\u20137631"},{"key":"41427_CR64","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.eswa.2019.01.070","volume":"125","author":"S Banerjee","year":"2019","unstructured":"Banerjee S, Jenamani M, Pratihar D K. ComBIM: A community-based solution approach for the budgeted influence maximization problem. Expert Systems with Applications, 2019, 125: 1\u201313","journal-title":"Expert Systems with Applications"},{"key":"41427_CR65","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/978-3-319-06608-0_6","volume-title":"Proceedings of the 18th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining","author":"S Han","year":"2014","unstructured":"Han S, Zhuang F, He Q, Shi Z. Balanced seed selection for budgeted influence maximization in social networks. In: Proceedings of the 18th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining. 2014, 65\u201377"},{"issue":"1","key":"41427_CR66","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller S, Moss A, Naor J. The budgeted maximum coverage problem. Information Processing Letters, 1999, 70(1): 39\u201345","journal-title":"Information Processing Letters"},{"key":"41427_CR67","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-04565-7","volume-title":"Approximation Algorithms","author":"V V Vazirani","year":"2003","unstructured":"Vazirani V V. Approximation Algorithms. Berlin: Springer, 2003"},{"issue":"3","key":"41427_CR68","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1089\/cmb.2010.0265","volume":"18","author":"F Vandin","year":"2011","unstructured":"Vandin F, Upfal E, Raphael B J. Algorithms for detecting significantly mutated pathways in cancer. Journal of Computational Biology, 2011, 18(3): 507\u2013522","journal-title":"Journal of Computational Biology"},{"issue":"1","key":"41427_CR69","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ipl.2008.03.017","volume":"108","author":"R Cohen","year":"2008","unstructured":"Cohen R, Katzir L. The generalized maximum coverage problem. Information Processing Letters, 2008, 108(1): 15\u201322","journal-title":"Information Processing Letters"},{"issue":"4","key":"41427_CR70","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1109\/MCI.2006.329691","volume":"1","author":"M Dorigo","year":"2006","unstructured":"Dorigo M, Birattari M, Stutzle T. Ant colony optimization. IEEE Computational Intelligence Magazine, 2006, 1(4): 28\u201339","journal-title":"IEEE Computational Intelligence Magazine"},{"issue":"3","key":"41427_CR71","doi-asserted-by":"publisher","first-page":"352","DOI":"10.14778\/3157794.3157803","volume":"11","author":"E T Zacharatou","year":"2017","unstructured":"Zacharatou E T, Doraiswamy H, Ailamaki A, Silva C T, Freire J. GPU rasterization for real-time spatial aggregation over arbitrary polygons. Proceedings of the VLDB Endowment, 2017, 11(3): 352\u2013365","journal-title":"Proceedings of the VLDB Endowment"},{"key":"41427_CR72","doi-asserted-by":"publisher","first-page":"2610","DOI":"10.1145\/3447548.3467158","volume-title":"Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining","author":"C Cao","year":"2021","unstructured":"Cao C, Li M. Generating mobility trajectories with retained data utility. In: Proceedings of the 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining. 2021, 2610\u20132620"},{"key":"41427_CR73","doi-asserted-by":"publisher","first-page":"2039","DOI":"10.1145\/2882903.2882963","volume-title":"Proceedings of 2016 International Conference on Management of Data","author":"J Peng","year":"2016","unstructured":"Peng J, Wang H, Li J, Gao H. Set-based similarity search for time series. In: Proceedings of 2016 International Conference on Management of Data. 2016, 2039\u20132052"},{"issue":"11","key":"41427_CR74","doi-asserted-by":"publisher","first-page":"2517","DOI":"10.14778\/3551793.3551811","volume":"15","author":"W Yang","year":"2022","unstructured":"Yang W, Wang S, Sun Y, Peng Z. Fast dataset search with earth mover\u2019s distance. Proceedings of the VLDB Endowment, 2022, 15(11): 2517\u20132529","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"1","key":"41427_CR75","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s00778-019-00574-9","volume":"29","author":"H Su","year":"2020","unstructured":"Su H, Liu S, Zheng B, Zhou X, Zheng K. A survey of trajectory distance measures and performance evaluation. The VLDB Journal, 2020, 29(1): 3\u201332","journal-title":"The VLDB Journal"},{"issue":"8","key":"41427_CR76","doi-asserted-by":"publisher","first-page":"506","DOI":"10.14778\/2002974.2002978","volume":"4","author":"S Nutanong","year":"2011","unstructured":"Nutanong S, Jacox E H, Samet H. An incremental hausdorff distance calculation algorithm. Proceedings of the VLDB Endowment, 2011, 4(8): 506\u2013517","journal-title":"Proceedings of the VLDB Endowment"},{"key":"41427_CR77","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1145\/342009.335414","volume-title":"Proceedings of 2000 ACM SIGMOD International Conference on Management of Data","author":"A Corral","year":"2000","unstructured":"Corral A, Manolopoulos Y, Theodoridis Y, Vassilakopoulos M. Closest pair queries in spatial databases. In: Proceedings of 2000 ACM SIGMOD International Conference on Management of Data. 2000, 189\u2013200"},{"issue":"3","key":"41427_CR78","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1109\/MC.2012.71","volume":"45","author":"F Vandin","year":"2012","unstructured":"Vandin F, Upfal E, Raphael B. Algorithms and genome sequencing: identifying driver pathways in cancer. Computer, 2012, 45(3): 39\u201346","journal-title":"Computer"},{"key":"41427_CR79","series-title":"Technical Report","first-page":"1","volume-title":"Five Balltree Construction Algorithms","author":"S M Omohundro","year":"1989","unstructured":"Omohundro S M. Five Balltree Construction Algorithms. Technical Report, International Computer Science Institute, Berkeley, California 1989, 1\u201322"}],"container-title":["Frontiers of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-41427-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11704-025-41427-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11704-025-41427-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,28]],"date-time":"2025-10-28T06:02:52Z","timestamp":1761631372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11704-025-41427-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,10,28]]},"references-count":79,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,3]]}},"alternative-id":["41427"],"URL":"https:\/\/doi.org\/10.1007\/s11704-025-41427-9","relation":{},"ISSN":["2095-2228","2095-2236"],"issn-type":[{"type":"print","value":"2095-2228"},{"type":"electronic","value":"2095-2236"}],"subject":[],"published":{"date-parts":[[2025,10,28]]},"assertion":[{"value":"29 December 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 May 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors declare that they have no competing interests or financial conflicts to disclose.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"2003612"}}