{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,7]],"date-time":"2025-06-07T19:05:30Z","timestamp":1749323130597,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_17","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"218-231","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Minimizing Distances Between Vertices and\u00a0Edges Through Tree t-Spanners"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0128-2807","authenticated-orcid":false,"given":"Fernanda","family":"Couto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3797-6053","authenticated-orcid":false,"given":"Lu\u00eds","family":"Cunha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-0367-0818","authenticated-orcid":false,"given":"Edmundo","family":"Pinto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3868-3401","authenticated-orcid":false,"given":"Daniel","family":"Posner","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Bhatt, S., Chung, F., Leighton, T., Rosenberg, A.: Optimal simulations of tree machines. In: Foundations of Computer Science, pp. 274\u2013282. IEEE (1986)","DOI":"10.1109\/SFCS.1986.38"},{"issue":"4","key":"17_CR2","doi-asserted-by":"publisher","first-page":"740","DOI":"10.1137\/0218050","volume":"18","author":"D Peleg","year":"1989","unstructured":"Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. SIAM J. Comput. 18(4), 740\u2013747 (1989)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"17_CR3","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S0895480192237403","volume":"8","author":"L Cai","year":"1995","unstructured":"Cai, L., Corneil, D.G.: Tree spanners. SIAM J. Discrete Math. 8(3), 359\u2013387 (1995)","journal-title":"SIAM J. Discrete Math."},{"key":"17_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-3-030-04651-4_4","volume-title":"Combinatorial Optimization and Applications","author":"F Couto","year":"2018","unstructured":"Couto, F., Cunha, L.F.I.: Tree t-spanners of a graph: minimizing maximum distances efficiently. In: Kim, D., Uma, R.N., Zelikovsky, A. (eds.) COCOA 2018. LNCS, vol. 11346, pp. 46\u201361. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-04651-4_4"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1016\/j.entcs.2019.08.032","volume":"346","author":"F Couto","year":"2019","unstructured":"Couto, F., Cunha, L.F.I.: Hardness and efficiency on minimizing maximum distances for graphs with few P4\u2019s and (k, $$\\ell $$)-graphs. Electron. Notes Theor. Comput. Sci. 346, 355\u2013367 (2019)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"issue":"1","key":"17_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/s00453-006-1209-y","volume":"47","author":"A Brandstadt","year":"2007","unstructured":"Brandstadt, A., Dragan, F.F., Le, H.-O., Uehara, R., et al.: Tree spanners for bipartite graphs and probe interval graphs. Algorithmica 47(1), 27\u201351 (2007)","journal-title":"Algorithmica"},{"key":"17_CR7","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.tcs.2020.06.012","volume":"838","author":"F Couto","year":"2020","unstructured":"Couto, F., Cunha, L.F.I.: Hardness and efficiency on minimizing maximum distances in spanning trees. Theor. Comput. Sci. 838, 168\u2013179 (2020)","journal-title":"Theor. Comput. Sci."},{"issue":"1\u20132","key":"17_CR8","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/S0166-218X(00)00226-2","volume":"108","author":"SP Fekete","year":"2001","unstructured":"Fekete, S.P., Kremer, J.: Tree spanners in planar graphs. Discrete Appl. Math. 108(1\u20132), 85\u2013103 (2001)","journal-title":"Discrete Appl. Math."},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1016\/j.dam.2021.08.010","volume":"304","author":"F Couto","year":"2021","unstructured":"Couto, F., Cunha, L.F.I.: Hardness and efficiency on t-admissibility for graph operations. Discrete Appl. Math. 304, 342\u2013348 (2021)","journal-title":"Discrete Appl. Math."},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1016\/j.dam.2017.10.025","volume":"236","author":"I Papoutsakis","year":"2018","unstructured":"Papoutsakis, I.: Tree spanners of bounded degree graphs. Discrete Appl. Math. 236, 395\u2013407 (2018)","journal-title":"Discrete Appl. Math."},{"key":"17_CR11","series-title":"LNCS","doi-asserted-by":"publisher","first-page":"557","DOI":"10.1007\/978-3-031-20624-5_34","volume-title":"LATIN 2022","author":"R G\u00f3mez","year":"2022","unstructured":"G\u00f3mez, R., Miyazawa, F.K., Wakabayashi, Y.: Tree 3-spanners on generalized prisms of graphs. In: Casta\u00f1eda, A., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATIN 2022. LNCS, vol. 13568, pp. 557\u2013573. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20624-5_34"},{"key":"17_CR12","series-title":"AIRO Springer Series","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/978-3-030-63072-0_16","volume-title":"Graphs and Combinatorial Optimization: from Theory to Applications","author":"F Couto","year":"2021","unstructured":"Couto, F., Cunha, L., Posner, D.: Edge tree spanners. In: Gentile, C., Stecca, G., Ventura, P. (eds.) Graphs and Combinatorial Optimization: from Theory to Applications. ASS, vol. 5, pp. 195\u2013207. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-63072-0_16"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0012-365X(76)90037-6","volume":"14","author":"T Hamada","year":"1976","unstructured":"Hamada, T., Yoshimura, I.: Traversability and connectivity of the middle graph of a graph. Discret. Math. 14(3), 247\u2013255 (1976)","journal-title":"Discret. Math."},{"key":"17_CR14","volume-title":"Algorithmic Graph Theory and Perfect Graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Elsevier, Amsterdam (2004)"},{"key":"17_CR15","unstructured":"Sedl\u00e1\u010dek, J.: Some properties of interchange graphs (in theory of graphs and its applications, m. fiedler, editor), pp. 145\u2013150 (1964)"},{"issue":"4","key":"17_CR16","doi-asserted-by":"publisher","first-page":"569","DOI":"10.1145\/321850.321853","volume":"21","author":"PG Lehot","year":"1974","unstructured":"Lehot, P.G.: An optimal algorithm to detect a line graph and output its root graph. J. ACM (JACM) 21(4), 569\u2013575 (1974)","journal-title":"J. ACM (JACM)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:12:16Z","timestamp":1718975536000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}