{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:05Z","timestamp":1725558965650},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540241324"},{"type":"electronic","value":"9783540305590"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30559-0_6","type":"book-chapter","created":{"date-parts":[[2010,7,2]],"date-time":"2010-07-02T19:01:42Z","timestamp":1278097302000},"page":"68-80","source":"Crossref","is-referenced-by-count":5,"title":["Collective Tree Spanners and Routing in AT-free Related Graphs"],"prefix":"10.1007","author":[{"given":"Feodor F.","family":"Dragan","sequence":"first","affiliation":[]},{"given":"Chenyu","family":"Yan","sequence":"additional","affiliation":[]},{"given":"Derek G.","family":"Corneil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0022-0000(89)90044-5","volume":"39","author":"L.P. Chew","year":"1989","unstructured":"Chew, L.P.: There are planar graphs almost as good as the complete graph. J. of Computer and System Sciences\u00a039, 205\u2013219 (1989)","journal-title":"J. of Computer and System Sciences"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1137\/S0895480193250125","volume":"10","author":"D.G. Corneil","year":"1997","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal Triple\u2013free Graphs. SIAM J. Discrete Math.\u00a010, 399\u2013430 (1997)","journal-title":"SIAM J. Discrete Math."},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"1284","DOI":"10.1137\/S0097539795282377","volume":"28","author":"D.G. Corneil","year":"1999","unstructured":"Corneil, D.G., Olariu, S., Stewart, L.: Linear time algorithms for dominating pairs in asteroidal triple\u2013free graphs. SIAM J. on Computing\u00a028, 1284\u20131297 (1999)","journal-title":"SIAM J. on Computing"},{"key":"6_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-540-27810-8_7","volume-title":"Algorithm Theory - SWAT 2004","author":"F.F. Dragan","year":"2004","unstructured":"Dragan, F.F., Yan, C., Lomonosov, I.: Collective Tree Spanners of Graphs. In: Hagerup, T., Katajainen, J. (eds.) SWAT 2004. LNCS, vol.\u00a03111, pp. 64\u201376. Springer, Heidelberg (2004)"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/3-540-44676-1_40","volume-title":"Algorithms - ESA 2001","author":"C. Gavoille","year":"2001","unstructured":"Gavoille, C., Katz, M., Katz, N.A., Paul, C., Peleg, D.: Approximate distance labeling schemes. In: Meyer auf der Heide, F. (ed.) ESA 2001. LNCS, vol.\u00a02161, pp. 476\u2013487. Springer, Heidelberg (2001)"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1006\/jagm.1998.0997","volume":"32","author":"T. Kloks","year":"1999","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: Approximating the bandwidth for asteroidal triple-free graphs. J. Algorithms\u00a032, 41\u201357 (1999)","journal-title":"J. Algorithms"},{"key":"6_CR7","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/s003730170043","volume":"17","author":"T. Kloks","year":"2001","unstructured":"Kloks, T., Kratsch, D., M\u00fcller, H.: On the structure of graphs with bounded asteroidal number. Graphs and Combinatorics\u00a017, 295\u2013306 (2001)","journal-title":"Graphs and Combinatorics"},{"key":"6_CR8","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1002\/net.3230230417","volume":"23","author":"A.L. Liestman","year":"1993","unstructured":"Liestman, A.L., Shermer, T.: Additive graph spanners. Networks 23, 343\u2013364 (1993)","journal-title":"Networks"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1006\/jagm.1994.1034","volume":"17","author":"T.H. Ma","year":"1994","unstructured":"Ma, T.H., Spinrad, J.P.: On the two-chain subgraph cover and related problems. J. of Algorithms\u00a017, 251\u2013268 (1994)","journal-title":"J. of Algorithms"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/0020-0190(96)00078-6","volume":"59","author":"M.S. Madanlal","year":"1996","unstructured":"Madanlal, M.S., Venkatesan, G., Pandu Rangan, C.: Tree 3-spanners on interval, permutation and regular bipartite graphs. Inform. Process. Lett.\u00a059, 97\u2013102 (1996)","journal-title":"Inform. Process. Lett."},{"key":"6_CR11","unstructured":"McConnell, R.M., Spinrad, J.P.: Linear-time transitive orientation. In: Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, Louisiana, January 5-7, pp. 19\u201325 (1997)"},{"key":"6_CR12","series-title":"SIAM Monographs on Discrete Math. Appl.","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898719772","volume-title":"Distributed Computing: A Locality-Sensitive Approach","author":"D. Peleg","year":"2000","unstructured":"Peleg, D.: Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Math. Appl. SIAM, Philadelphia (2000)"},{"key":"6_CR13","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1002\/jgt.3190130114","volume":"13","author":"D. Peleg","year":"1989","unstructured":"Peleg, D., and Sch\u00e4ffer, A.A.: Graph Spanners. J. Graph Theory\u00a013, 99\u2013116 (1989)","journal-title":"J. Graph Theory"},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"Peleg, D., Ullman, J.D.: An optimal synchronizer for the hypercube. In: Proc. 6th ACM Symposium on Principles of Distributed Computing, Vancouver, pp. 77\u201385 (1987)","DOI":"10.1145\/41840.41847"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"332","DOI":"10.1137\/S0895480195295471","volume":"17","author":"E. Prisner","year":"2003","unstructured":"Prisner, E., Kratsch, D., Le, H.-O., M\u00fcller, H., Wagner, D.: Additive tree spanners. SIAM Journal on Discrete Mathematics\u00a017, 332\u2013340 (2003)","journal-title":"SIAM Journal on Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Graph-Theoretic Concepts in Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30559-0_6.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:04Z","timestamp":1620012604000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30559-0_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540241324","9783540305590"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30559-0_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}