{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:00Z","timestamp":1725701640280},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_60","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"695-706","source":"Crossref","is-referenced-by-count":2,"title":["Minimum Average Distance Triangulations"],"prefix":"10.1007","author":[{"given":"L\u00e1szl\u00f3","family":"Kozma","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"60_CR1","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1002\/net.3230080402","volume":"8","author":"D.S. Johnson","year":"1978","unstructured":"Johnson, D.S., Lenstra, J.K., Kan, A.H.G.R.: The complexity of the network design problem. Networks\u00a08(4), 279\u2013285 (1978)","journal-title":"Networks"},{"issue":"1","key":"60_CR2","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1021\/ja01193a005","volume":"69","author":"H. Wiener","year":"1947","unstructured":"Wiener, H.: Structural Determination of Paraffin Boiling Points. J. of the Am. Chem. Soc.\u00a069(1), 17\u201320 (1947)","journal-title":"J. of the Am. Chem. Soc."},{"key":"60_CR3","doi-asserted-by":"crossref","unstructured":"Rouvray, D.H.: Predicting chemistry from topology. Sci. Am.\u00a0255 (1986)","DOI":"10.1038\/scientificamerican0986-40"},{"key":"60_CR4","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/BF01167206","volume":"2","author":"B. Mohar","year":"1988","unstructured":"Mohar, B., Pisanski, T.: How to compute the Wiener index of a graph. J. of Mathematical Chemistry\u00a02, 267\u2013277 (1988)","journal-title":"J. of Mathematical Chemistry"},{"key":"60_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010767517079","volume":"66","author":"A.A. Dobrynin","year":"2001","unstructured":"Dobrynin, A.A., Entringer, R., Gutman, I.: Wiener index of trees: Theory and applications. Acta Applicandae Mathematicae\u00a066, 211\u2013249 (2001)","journal-title":"Acta Applicandae Mathematicae"},{"key":"60_CR6","unstructured":"Nilsen, C.W.: Wiener index and diameter of a planar graph in subquadratic time (2009)"},{"key":"60_CR7","doi-asserted-by":"crossref","unstructured":"Aurenhammer, F., Xu, Y.: Optimal triangulations. In: Encyclopedia of Optimization, pp. 2757\u20132764 (2009)","DOI":"10.1007\/978-0-387-74759-0_475"},{"key":"60_CR8","doi-asserted-by":"crossref","unstructured":"Bern, M.W., Eppstein, D.: Mesh generation and optimal triangulation. In: Computing in Euclidean Geometry, pp. 23\u201390 (1992)","DOI":"10.1142\/9789814355858_0002"},{"key":"60_CR9","unstructured":"Gilbert, P.D.: New results in planar triangulations. Report R-850, Coordinated Sci. Lab., Univ. Illinois, Urbana, IL (1979)"},{"key":"60_CR10","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1016\/S0167-5060(08)70044-X","volume":"9","author":"G.T. Klincsek","year":"1980","unstructured":"Klincsek, G.T.: Minimal triangulations of polygonal domains. Discr. Math.\u00a09, 121\u2013123 (1980)","journal-title":"Discr. Math."},{"key":"60_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1346330.1346336","volume":"55","author":"W. Mulzer","year":"2008","unstructured":"Mulzer, W., Rote, G.: Minimum-weight triangulation is NP-hard. J. ACM\u00a055, 11: 1\u201311 (2008)","journal-title":"J. ACM"},{"key":"60_CR12","unstructured":"Kozma, L.: Minimum average distance triangulations (2012), \n                  \n                    http:\/\/arxiv.org\/abs\/1112.1828"},{"issue":"2","key":"60_CR13","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput.\u00a011(2), 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"key":"60_CR14","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1137\/0405033","volume":"5","author":"D.E. Knuth","year":"1992","unstructured":"Knuth, D.E., Raghunathan, A.: The problem of compatible representatives. SIAM J. Discr. Math.\u00a05, 422\u2013427 (1992)","journal-title":"SIAM J. Discr. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_60.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:55:04Z","timestamp":1620129304000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_60"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_60","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}