{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,10]],"date-time":"2026-04-10T16:43:13Z","timestamp":1775839393065,"version":"3.50.1"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046507","type":"print"},{"value":"9783030046514","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_4","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"46-61","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Tree t-Spanners of a Graph: Minimizing Maximum Distances Efficiently"],"prefix":"10.1007","author":[{"given":"Fernanda","family":"Couto","sequence":"first","affiliation":[]},{"given":"Lu\u00eds Felipe I.","family":"Cunha","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. In: Proceedings of the 6th ACM Symposium on Principles of Distributed Computing, Vancouver, pp. 77\u201385 (1987)","DOI":"10.1145\/41840.41847"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1007\/BF02189308","volume":"9","author":"I Alth\u00f6fer","year":"1993","unstructured":"Alth\u00f6fer, I., Das, G., Dobkin, D., Joseph, D., Soares, J.: On sparse spanners of weighted graphs. Discrete Comput. Geom. 9(1), 81\u2013100 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Bhatt, S., Chung, F., Leighton, T., Rosenberg, A.: Optimal simulations of tree machines. In: 27th Annual Symposium on Foundations of Computer Science, pp. 274\u2013282. IEEE (1986)","DOI":"10.1109\/SFCS.1986.38"},{"issue":"3","key":"4_CR4","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."},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"872","DOI":"10.1137\/120873996","volume":"43","author":"N Bansal","year":"2014","unstructured":"Bansal, N., et al.: Min-max graph partitioning and small set expansion. SIAM J. Comput. 43(2), 872\u2013904 (2014)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0890-5401(03)00057-9","volume":"185","author":"JK Lanctot","year":"2003","unstructured":"Lanctot, J.K., Li, M., Ma, B., Wang, S., Zhang, L.: Distinguishing string selection problems. Inf. Comput. 185(1), 41\u201355 (2003)","journal-title":"Inf. Comput."},{"issue":"1\u20132","key":"4_CR7","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."},{"issue":"1\u20133","key":"4_CR8","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0304-3975(03)00424-9","volume":"310","author":"A Brandst\u00e4dt","year":"2004","unstructured":"Brandst\u00e4dt, A., Dragan, F.F., Le, H.-O., et al.: Tree spanners on chordal graphs: complexity and algorithms. Theor. Comput. Sci. 310(1\u20133), 329\u2013354 (2004)","journal-title":"Theor. Comput. Sci."},{"issue":"17","key":"4_CR9","doi-asserted-by":"publisher","first-page":"1913","DOI":"10.1016\/j.dam.2010.08.015","volume":"158","author":"B Panda","year":"2010","unstructured":"Panda, B., Das, A.: Tree 3-spanners in 2-sep chordal graphs: characterization and algorithms. Discrete Appl. Math. 158(17), 1913\u20131935 (2010)","journal-title":"Discrete Appl. Math."},{"key":"4_CR10","volume-title":"Introduction to Graph Theory","author":"DB West","year":"2001","unstructured":"West, D.B., et al.: Introduction to Graph Theory, vol. 2. Prentice Hall, Upper Saddle River (2001)"},{"key":"4_CR11","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-970-5","volume-title":"Graph Theory","author":"J. A. Bondy","year":"2008","unstructured":"Bondy, J., Murty, U.: Graph Theory, vol. 44 (2008)"},{"key":"4_CR12","doi-asserted-by":"crossref","unstructured":"Bondy, J.A., Murty, U.S.R., et al.: Graph Theory with Applications, vol. 290. Citeseer (1976)","DOI":"10.1007\/978-1-349-03521-2"},{"issue":"2","key":"4_CR13","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/0020-0190(94)00183-Y","volume":"53","author":"R Hassin","year":"1995","unstructured":"Hassin, R., Tamir, A.: On the minimum diameter spanning tree problem. Inf. Process. Lett. 53(2), 109\u2013111 (1995)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"4_CR14","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/0012-365X(89)90079-4","volume":"75","author":"J Bondy","year":"1989","unstructured":"Bondy, J.: Trigraphs. Discrete Math. 75(1\u20133), 69\u201379 (1989)","journal-title":"Discrete Math."},{"issue":"2\u20133","key":"4_CR15","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0012-365X(83)90154-1","volume":"43","author":"M Farber","year":"1983","unstructured":"Farber, M.: Characterizations of strongly chordal graphs. Discrete Math. 43(2\u20133), 173\u2013189 (1983)","journal-title":"Discrete Math."},{"issue":"3","key":"4_CR16","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1016\/0196-6774(88)90023-5","volume":"9","author":"MC Golumbic","year":"1988","unstructured":"Golumbic, M.C., Hammer, P.L.: Stability in circular arc graphs. J. Algorithm 9(3), 314\u2013320 (1988)","journal-title":"J. Algorithm"},{"issue":"1\u20133","key":"4_CR17","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1016\/S0012-365X(02)00502-2","volume":"262","author":"MA Piza\u00f1a","year":"2003","unstructured":"Piza\u00f1a, M.A.: The icosahedron is clique divergent. Discrete Math. 262(1\u20133), 229\u2013239 (2003)","journal-title":"Discrete Math."},{"key":"4_CR18","doi-asserted-by":"crossref","unstructured":"Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs, vol. 57. Elsevier (2004)","DOI":"10.1016\/S0167-5060(04)80051-7"},{"key":"4_CR19","doi-asserted-by":"crossref","unstructured":"Spinrad, J.P.: Efficient Graph Representations: The Fields Institute for Research in Mathematical Sciences, vol. 19. American Mathematical Society (2003)","DOI":"10.1090\/fim\/019"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:46:47Z","timestamp":1710344807000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}