{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:01:52Z","timestamp":1725562912383},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642151545"},{"type":"electronic","value":"9783642151552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15155-2_15","type":"book-chapter","created":{"date-parts":[[2010,8,13]],"date-time":"2010-08-13T20:17:45Z","timestamp":1281730665000},"page":"150-161","source":"Crossref","is-referenced-by-count":0,"title":["Improved Approximability and Non-approximability Results for Graph Diameter Decreasing Problems"],"prefix":"10.1007","author":[{"given":"Davide","family":"Bil\u00f2","sequence":"first","affiliation":[]},{"given":"Luciano","family":"Gual\u00e0","sequence":"additional","affiliation":[]},{"given":"Guido","family":"Proietti","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"15_CR1","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1002\/1097-0118(200011)35:3<161::AID-JGT1>3.0.CO;2-Y","volume":"35","author":"N. Alon","year":"2000","unstructured":"Alon, N., Gy\u00e1rf\u00e1s, A., Ruszink\u00f3, M.: Decreasing the diameter of bounded degree graphs. Journal of Graph Theory\u00a035(3), 161\u2013172 (2000)","journal-title":"Journal of Graph Theory"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Brandst\u00e4dt, A., Le, V.B., Spinrad, J.: Graph classes: a survey. SIAM Monographs on Discrete Mathematics and Applications (1999)","DOI":"10.1137\/1.9780898719796"},{"issue":"1","key":"15_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1287\/moor.6.1.50","volume":"6","author":"R. Chandrasekaran","year":"1981","unstructured":"Chandrasekaran, R., Daughety, A.: Location on tree networks: p-centre and n-dispersion problems. Mathematics of Operations Research\u00a06(1), 50\u201357 (1981)","journal-title":"Mathematics of Operations Research"},{"issue":"2","key":"15_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s00453-005-1183-9","volume":"45","author":"V. Chepoi","year":"2006","unstructured":"Chepoi, V., Estellon, B., Nouioua, K., Vax\u00e8s, Y.: Mixed covering of trees and the augmentation problem with odd diameter constraints. Algorithmica\u00a045(2), 209\u2013226 (2006)","journal-title":"Algorithmica"},{"issue":"2","key":"15_CR5","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s00453-001-0113-8","volume":"33","author":"V. Chepoi","year":"2002","unstructured":"Chepoi, V., Vax\u00e8s, Y.: Augmenting trees to meet biconnectivity and diameter constraints. Algorithmica\u00a033(2), 243\u2013262 (2002)","journal-title":"Algorithmica"},{"key":"15_CR6","first-page":"295","volume":"60","author":"F. Chung","year":"1987","unstructured":"Chung, F.: Diameters of graph: old problems and new results. Congr. Numer.\u00a060, 295\u2013317 (1987)","journal-title":"Congr. Numer."},{"issue":"4","key":"15_CR7","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1002\/jgt.3190080408","volume":"8","author":"F. Chung","year":"1984","unstructured":"Chung, F., Garey, M.: Diameter bounds for altered graphs. Journal of Graph Theory\u00a08(4), 511\u2013534 (1984)","journal-title":"Journal of Graph Theory"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Dodis, Y., Khanna, S.: Designing networks with bounded pairwise distance. In: STOC, pp. 750\u2013759 (1999)","DOI":"10.1145\/301250.301447"},{"issue":"4","key":"15_CR9","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/s004930050035","volume":"18","author":"P. Erd\u00f6s","year":"1998","unstructured":"Erd\u00f6s, P., Gy\u00e1rf\u00e1s, A., Ruszink\u00f3, M.: How to decrease the diameter of triangle-free graphs. Combinatorica\u00a018(4), 493\u2013501 (1998)","journal-title":"Combinatorica"},{"issue":"7","key":"15_CR10","first-page":"623","volume":"B","author":"P. Erd\u00f6s","year":"1963","unstructured":"Erd\u00f6s, P., R\u00e9nyi, A.: On a problem in the theory of graphs. Publ. Math. Inst. Hung. Acad. Sci.\u00a0B(7), 623\u2013639 (1963)","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T.F. Gonzalez","year":"1985","unstructured":"Gonzalez, T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci.\u00a038, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"15_CR12","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1002\/jgt.10122","volume":"43","author":"E. Grigorescu","year":"2003","unstructured":"Grigorescu, E.: Decreasing the diameter of cycles. J. Graph Theory\u00a043(4), 299\u2013303 (2003)","journal-title":"J. Graph Theory"},{"key":"15_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-540-24587-2_45","volume-title":"Algorithms and Computation","author":"T. Ishii","year":"2003","unstructured":"Ishii, T., Yamamoto, S., Nagamochi, H.: Augmenting forests to meet odd diameter requirements. In: Ibaraki, T., Katoh, N., Ono, H. (eds.) ISAAC 2003. LNCS, vol.\u00a02906, pp. 434\u2013443. Springer, Heidelberg (2003)"},{"issue":"4","key":"15_CR14","doi-asserted-by":"publisher","first-page":"779","DOI":"10.1007\/s00224-006-1305-z","volume":"41","author":"S. Kapoor","year":"2007","unstructured":"Kapoor, S., Sarwat, M.: Bounded-diameter minimum-cost graph problems. Theory Comput. Syst.\u00a041(4), 779\u2013794 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"15_CR15","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1137\/0137040","volume":"37","author":"O. Kariv","year":"1979","unstructured":"Kariv, O., Hakimi, S.: An algorithmic approach to network location problems. SIAM Journal on Applied Mathematics\u00a037(3), 513\u2013538 (1979)","journal-title":"SIAM Journal on Applied Mathematics"},{"key":"15_CR16","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0167-6377(92)90007-P","volume":"11","author":"C.-L. Li","year":"1992","unstructured":"Li, C.-L., McCormick, S.T., Simchi-Levi, D.: On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problem. Operations Research Letters\u00a011, 303\u2013308 (1992)","journal-title":"Operations Research Letters"},{"key":"15_CR17","doi-asserted-by":"crossref","unstructured":"Plesn\u00edk, J.: On the computational complexity of centers locating in a graph. Aplikace Mat.\u00a025","DOI":"10.21136\/AM.1980.103883"},{"issue":"1","key":"15_CR18","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1002\/net.3230110110","volume":"11","author":"J. Plesn\u00edk","year":"1981","unstructured":"Plesn\u00edk, J.: The complexity of designing a network with minimum diameter. Networks\u00a011(1), 77\u201385 (1981)","journal-title":"Networks"},{"key":"15_CR19","doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and a sub-constant error-probability pcp characterization of np. In: STOC, pp. 475\u2013484 (1997)","DOI":"10.1145\/258533.258641"},{"issue":"3","key":"15_CR20","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1002\/jgt.3190110315","volume":"11","author":"A.A. Schoone","year":"1987","unstructured":"Schoone, A.A., Bodlaender, H.L., van Leeuwen, J.: Diameter increase caused by edge deletion. Journal of Graph Theory\u00a011(3), 409\u2013427 (1987)","journal-title":"Journal of Graph Theory"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15155-2_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,11,5]],"date-time":"2021-11-05T13:32:27Z","timestamp":1636119147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15155-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642151545","9783642151552"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15155-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}