{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:19:09Z","timestamp":1743002349521,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030609351"},{"type":"electronic","value":"9783030609368"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-60936-8_9","type":"book-chapter","created":{"date-parts":[[2020,10,14]],"date-time":"2020-10-14T10:05:52Z","timestamp":1602669952000},"page":"111-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Metric Search Is Equivalent to the Minimum Dominating Set Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4204-2017","authenticated-orcid":false,"given":"Magnus Lie","family":"Hetland","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,10,14]]},"reference":[{"key":"9_CR1","doi-asserted-by":"publisher","unstructured":"Backurs, A., Indyk, P.: Edit distance cannot be computed in strongly subquadratic time (unless SETH is false). In: Proceedings of the 47th Annual ACM Symposium on Theory of Computing (2015). https:\/\/doi.org\/10.1145\/2746539.2746612","DOI":"10.1145\/2746539.2746612"},{"key":"9_CR2","doi-asserted-by":"publisher","unstructured":"Beecks, C., Uysal, M.S., Seidl, T.: Signature quadratic form distance. In: Proceedings of the ACM International Conference on Image and Video Retrieval. ACM, New York, NY, USA (2010). https:\/\/doi.org\/10.1145\/1816041.1816105","DOI":"10.1145\/1816041.1816105"},{"issue":"5","key":"9_CR3","doi-asserted-by":"publisher","first-page":"1938","DOI":"10.1007\/s00453-018-0519-1","volume":"81","author":"J Boyar","year":"2018","unstructured":"Boyar, J., Eidenbenz, S.J., Favrholdt, L.M., Kotrb\u010d\u00edk, M., Larsen, K.S.: Online dominating set. Algorithmica 81(5), 1938\u20131964 (2018). https:\/\/doi.org\/10.1007\/s00453-018-0519-1","journal-title":"Algorithmica"},{"issue":"14","key":"9_CR4","doi-asserted-by":"publisher","first-page":"2357","DOI":"10.1016\/S0167-8655(03)00065-5","volume":"24","author":"B Bustos","year":"2003","unstructured":"Bustos, B., Navarro, G., Ch\u00e1vez, E.: Pivot selection techniques for proximity searching in metric spaces. Pattern Recogn. Lett. 24(14), 2357\u20132366 (2003). https:\/\/doi.org\/10.1016\/S0167-8655(03)00065-5","journal-title":"Pattern Recogn. Lett."},{"issue":"3","key":"9_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1145\/502807.502808","volume":"33","author":"E Ch\u00e1vez","year":"2001","unstructured":"Ch\u00e1vez, E., Navarro, G., Baeza-Yates, R., Marroqu\u00edn, J.L.: Searching in metric spaces. ACM Comput. Surv. 33(3), 273\u2013321 (2001). https:\/\/doi.org\/10.1145\/502807.502808","journal-title":"ACM Comput. Surv."},{"key":"9_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1007\/978-3-540-30140-0_19","volume-title":"Algorithms \u2013 ESA 2004","author":"M Chleb\u00edk","year":"2004","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of dominating set problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol. 3221, pp. 192\u2013203. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30140-0_19"},{"issue":"4","key":"9_CR7","doi-asserted-by":"publisher","first-page":"1713","DOI":"10.1007\/s40995-018-0618-5","volume":"43","author":"A Das","year":"2018","unstructured":"Das, A.: Partial domination in graphs. Iran. J. Sci. Technol. Trans. A Sci. 43(4), 1713\u20131718 (2018). https:\/\/doi.org\/10.1007\/s40995-018-0618-5","journal-title":"Iran. J. Sci. Technol. Trans. A Sci."},{"key":"9_CR8","doi-asserted-by":"publisher","unstructured":"Edsberg, O., Hetland, M.L.: Indexing inexact proximity search with distance regression in pivot space. In: Proceedings of the 3rd International Conference on Similarity Search and Applications (2010). https:\/\/doi.org\/10.1145\/1862344.1862353","DOI":"10.1145\/1862344.1862353"},{"key":"9_CR9","unstructured":"Figueroa, K., Navarro, G., Ch\u00e1vez, E.: Metric spaces library (2007). http:\/\/www.sisap.org\/Metric_Space_Library.html"},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/1498698.1564506","volume":"14","author":"K Figueroa","year":"2010","unstructured":"Figueroa, K., Ch\u00e1vez, E., Navarro, G., Paredes, R.: Speeding up spatial approximation search in metric spaces. J. Exp. Algorithmics 14, 3\u20136 (2010). https:\/\/doi.org\/10.1145\/1498698.1564506","journal-title":"J. Exp. Algorithmics"},{"issue":"5","key":"9_CR11","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1080\/00029890.1959.11989306","volume":"66","author":"LR Ford Jr","year":"1959","unstructured":"Ford Jr., L.R., Johnson, S.M.: A tournament problem. Am. Math. Mon. 66(5), 37\u201340 (1959). https:\/\/doi.org\/10.1080\/00029890.1959.11989306","journal-title":"Am. Math. Mon."},{"key":"9_CR12","unstructured":"Gurobi Optimization, LLC.: Gurobi optimizer reference manual (2020). http:\/\/gurobi.com"},{"key":"9_CR13","unstructured":"Kann, V.: On the Approximability of NP-complete Optimization Problems. Ph.D. thesis, Department of Numerical Analysis and Computing Science, Royal Institute of Technology, Stockholm (1992)"},{"issue":"4","key":"9_CR14","first-page":"843","volume":"35","author":"C Lee","year":"1998","unstructured":"Lee, C.: Domination in digraphs. J. Korean Math. Soc. 35(4), 843\u2013853 (1998)","journal-title":"J. Korean Math. Soc."},{"issue":"6","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1150","DOI":"10.1016\/j.physa.2010.11.027","volume":"390","author":"L L\u00fc","year":"2011","unstructured":"L\u00fc, L., Zhou, T.: Link prediction in complex networks: a survey. Physica A stat. Mech. Appl. 390(6), 1150\u20131170 (2011). https:\/\/doi.org\/10.1016\/j.physa.2010.11.027","journal-title":"Physica A stat. Mech. Appl."},{"key":"9_CR16","doi-asserted-by":"publisher","unstructured":"Mao, R., Liu, X., Tang, H., Luo, Q., Chen, J., Wu, W.: Multivariate regression for pivot selection: a preliminary study. In: 2011 3rd Symposium on Web Society. IEEE (2011). https:\/\/doi.org\/10.1109\/SWS.2011.6101281","DOI":"10.1109\/SWS.2011.6101281"},{"issue":"7","key":"9_CR17","doi-asserted-by":"publisher","first-page":"1007","DOI":"10.1016\/j.is.2012.05.012","volume":"38","author":"T Murakami","year":"2013","unstructured":"Murakami, T., Takahashi, K., Serita, S., Fujii, Y.: Probabilistic enhancement of approximate indexing in metric spaces. Inf. Syst. 38(7), 1007\u20131018 (2013). https:\/\/doi.org\/10.1016\/j.is.2012.05.012","journal-title":"Inf. Syst."},{"key":"9_CR18","unstructured":"Naidan, B., Hetland, M.L.: Shrinking data balls in metric indexes. In: DBKDA (2013)"},{"key":"9_CR19","doi-asserted-by":"publisher","unstructured":"Navarro, G.: Analyzing metric space indexes: what for? In: Proceedings of the 2009 2nd International Workshop on Similarity Search and Applications, SISAP 2009. IEEE Computer Society (2009). https:\/\/doi.org\/10.1109\/SISAP.2009.17","DOI":"10.1109\/SISAP.2009.17"},{"key":"9_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-012-9638-2","author":"V Pestov","year":"2013","unstructured":"Pestov, V.: Lower bounds on performance of metric tree indexing schemes for exact similarity search in high dimensions. Algorithmica (2013). https:\/\/doi.org\/10.1007\/s00453-012-9638-2","journal-title":"Algorithmica"},{"issue":"4","key":"9_CR21","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1292609.1292619","volume":"32","author":"T Skopal","year":"2007","unstructured":"Skopal, T.: Unified framework for exact and approximate search in dissimilarity spaces. ACM Trans. Database Syst. (TODS) 32(4), 1\u201345 (2007). https:\/\/doi.org\/10.1145\/1292609.1292619","journal-title":"ACM Trans. Database Syst. (TODS)"},{"issue":"11","key":"9_CR22","doi-asserted-by":"publisher","first-page":"1511","DOI":"10.1016\/j.patrec.2011.04.016","volume":"32","author":"R Socorro","year":"2011","unstructured":"Socorro, R., Mic\u00f3, L., Oncina, J.: A fast pivot-based indexing algorithm for metric spaces. Pattern Recogn. Lett. 32(11), 1511\u20131516 (2011). https:\/\/doi.org\/10.1016\/j.patrec.2011.04.016","journal-title":"Pattern Recogn. Lett."},{"issue":"4","key":"9_CR23","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.ipl.2005.02.009","volume":"94","author":"OA Telelis","year":"2005","unstructured":"Telelis, O.A., Zissimopoulos, V.: Absolute $$o(\\log m)$$ error in approximating random set covering: an average case analysis. Inf. Process. Lett. 94(4), 171\u2013177 (2005). https:\/\/doi.org\/10.1016\/j.ipl.2005.02.009","journal-title":"Inf. Process. Lett."},{"key":"9_CR24","doi-asserted-by":"publisher","unstructured":"Traina Jr., C.: Distance exponent: a new concept for selectivity estimation in metric trees. In: Proceedings of the 16th International Conference on Data Engineering (2000). https:\/\/doi.org\/10.1109\/ICDE.2000.839409","DOI":"10.1109\/ICDE.2000.839409"},{"issue":"3","key":"9_CR25","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/0167-8655(86)90013-9","volume":"4","author":"E Vidal Ruiz","year":"1986","unstructured":"Vidal Ruiz, E.: An algorithm for finding nearest neighbours in (approximately) constant average time. Pattern Recogn. Lett. 4(3), 145\u2013157 (1986). https:\/\/doi.org\/10.1016\/0167-8655(86)90013-9","journal-title":"Pattern Recogn. Lett."},{"key":"9_CR26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"}],"container-title":["Lecture Notes in Computer Science","Similarity Search and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-60936-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,12]],"date-time":"2024-03-12T13:42:20Z","timestamp":1710250940000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-60936-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030609351","9783030609368"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-60936-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"14 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SISAP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Similarity Search and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Copenhagen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Denmark","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 October 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sisap2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.sisap.org\/2020\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"50","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"19","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"12","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.9","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 short papers accepted for the SISAP 2020 Doctoral Symposium are also included. The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}