{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T07:03:09Z","timestamp":1742972589804,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030835071"},{"type":"electronic","value":"9783030835088"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"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":[[2021]]},"DOI":"10.1007\/978-3-030-83508-8_7","type":"book-chapter","created":{"date-parts":[[2021,7,30]],"date-time":"2021-07-30T13:05:06Z","timestamp":1627650306000},"page":"85-100","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Minimum Generalized Manhattan Connections"],"prefix":"10.1007","author":[{"given":"Antonios","family":"Antoniadis","sequence":"first","affiliation":[]},{"given":"Margarita","family":"Capretto","sequence":"additional","affiliation":[]},{"given":"Parinya","family":"Chalermsook","sequence":"additional","affiliation":[]},{"given":"Christoph","family":"Damerius","sequence":"additional","affiliation":[]},{"given":"Peter","family":"Kling","sequence":"additional","affiliation":[]},{"given":"Lukas","family":"N\u00f6lke","sequence":"additional","affiliation":[]},{"given":"Nidia","family":"Obscura Acosta","sequence":"additional","affiliation":[]},{"given":"Joachim","family":"Spoerhase","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,7,31]]},"reference":[{"key":"7_CR1","unstructured":"Antoniadis, A., et al.: On minimum generalized Manhattan connections. CoRR abs\/2010.14338 (2020). https:\/\/arxiv.org\/abs\/2010.14338"},{"key":"7_CR2","unstructured":"Chalermsook, P., Chuzhoy, J., Saranurak, T.: Pinning down the strong Wilber 1 bound for binary search trees. arXiv preprint arXiv:1912.02900 (2019)"},{"key":"7_CR3","doi-asserted-by":"crossref","unstructured":"Chalermsook, P., Goswami, M., Kozma, L., Mehlhorn, K., Saranurak, T.: Pattern-avoiding access in binary search trees. In: 2015 IEEE 56th Annual Symposium on Foundations of Computer Science, pp. 410\u2013423. IEEE (2015)","DOI":"10.1109\/FOCS.2015.32"},{"issue":"2","key":"7_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1921659.1921664","volume":"7","author":"C Chekuri","year":"2011","unstructured":"Chekuri, C., Even, G., Gupta, A., Segev, D.: Set connectivity problems in undirected graphs and the directed Steiner network problem. ACM Trans. Algorithms (TALG) 7(2), 1\u201317 (2011)","journal-title":"ACM Trans. Algorithms (TALG)"},{"issue":"1","key":"7_CR5","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1016\/j.tcs.2007.10.013","volume":"390","author":"V Chepoi","year":"2008","unstructured":"Chepoi, V., Nouioua, K., Vaxes, Y.: A rounding algorithm for approximating minimum Manhattan networks. Theoret. Comput. Sci. 390(1), 56\u201369 (2008)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"7_CR6","doi-asserted-by":"publisher","first-page":"701","DOI":"10.1007\/s00454-011-9342-z","volume":"45","author":"FY Chin","year":"2011","unstructured":"Chin, F.Y., Guo, Z., Sun, H.: Minimum Manhattan network is NP-complete. Discrete Comput. Geom. 45(4), 701\u2013722 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"7_CR7","doi-asserted-by":"crossref","unstructured":"Cole, R.: On the dynamic finger conjecture for splay trees. part II: the proof. SIAM J. Comput. 30(1), 44\u201385 (2000)","DOI":"10.1137\/S009753979732699X"},{"issue":"4","key":"7_CR8","doi-asserted-by":"publisher","first-page":"1170","DOI":"10.1007\/s00453-017-0298-0","volume":"80","author":"A Das","year":"2018","unstructured":"Das, A., Fleszar, K., Kobourov, S., Spoerhase, J., Veeramoni, S., Wolff, A.: Approximating the generalized minimum Manhattan network problem. Algorithmica 80(4), 1170\u20131190 (2018)","journal-title":"Algorithmica"},{"issue":"1","key":"7_CR9","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/s00453-013-9778-z","volume":"71","author":"A Das","year":"2015","unstructured":"Das, A., Gansner, E.R., Kaufmann, M., Kobourov, S., Spoerhase, J., Wolff, A.: Approximating minimum Manhattan networks in higher dimensions. Algorithmica 71(1), 36\u201352 (2015)","journal-title":"Algorithmica"},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Demaine, E.D., Harmon, D., Iacono, J., Kane, D., P\u0103tra\u015fcu, M.: The geometry of binary search trees. In: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 496\u2013505. SIAM (2009)","DOI":"10.1137\/1.9781611973068.55"},{"issue":"1","key":"7_CR11","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1137\/S0097539705447347","volume":"37","author":"ED Demaine","year":"2007","unstructured":"Demaine, E.D., Harmon, D., Iacono, J., P\u0103tra\u015fcu, M.: Dynamic optimality-almost. SIAM J. Comput. 37(1), 240\u2013251 (2007)","journal-title":"SIAM J. Comput."},{"key":"7_CR12","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Khanna, S.: Design networks with bounded pairwise distance. In: Proceedings of the Thirty-first Annual ACM Symposium on Theory of Computing, pp. 750\u2013759 (1999)","DOI":"10.1145\/301250.301447"},{"issue":"1","key":"7_CR13","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.jcss.2011.05.009","volume":"78","author":"M Feldman","year":"2012","unstructured":"Feldman, M., Kortsarz, G., Nutov, Z.: Improved approximation algorithms for directed Steiner forest. J. Comput. Syst. Sci. 78(1), 279\u2013292 (2012)","journal-title":"J. Comput. Syst. Sci."},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 57. North-Holland Publishing Co., NLD (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"7_CR15","unstructured":"Gudmundsson, J., Levcopoulos, C., Narasimhan, G.: Approximating a minimum Manhattan network. Nordic J. Comput. 8(2), 219\u2013232 (2001). http:\/\/dl.acm.org\/citation.cfm?id=766533.766536"},{"key":"7_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-68880-8_21","volume-title":"Algorithmic Aspects in Information and Management","author":"Z Guo","year":"2008","unstructured":"Guo, Z., Sun, H., Zhu, H.: A fast 2-approximation algorithm for the minimum Manhattan network problem. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol. 5034, pp. 212\u2013223. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68880-8_21"},{"key":"7_CR17","unstructured":"Harmon, D.D.K.: New bounds on optimal binary search trees. Ph.D. thesis, Massachusetts Institute of Technology (2006)"},{"key":"7_CR18","doi-asserted-by":"crossref","unstructured":"Iacono, J., Langerman, S.: Weighted dynamic finger in binary search trees. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 672\u2013691. SIAM (2016)","DOI":"10.1137\/1.9781611974331.ch49"},{"issue":"3","key":"7_CR19","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM (JACM) 32(3), 652\u2013686 (1985)","journal-title":"J. ACM (JACM)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-83508-8_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,2,18]],"date-time":"2022-02-18T11:25:17Z","timestamp":1645183517000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-83508-8_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030835071","9783030835088"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-83508-8_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"31 July 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WADS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Workshop on Algorithms and Data Structures","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 August 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 August 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wads2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/projects.cs.dal.ca\/wads2021\/","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":"123","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":"47","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":"0","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.1","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":"13","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)"}}]}}