{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:13Z","timestamp":1725549673963},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_25","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"282-293","source":"Crossref","is-referenced-by-count":0,"title":["Approximation Algorithms for Forests Augmentation Ensuring Two Disjoint Paths of Bounded Length"],"prefix":"10.1007","author":[{"given":"Victor","family":"Chepoi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bertrand","family":"Estellon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yann","family":"Vax\u00e8s","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_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., Gyarfas, A., Ruszinko, M.: Decreasing the diameter of bounded degree graphs. J. Graph Theory\u00a035, 161\u2013172 (2000)","journal-title":"J. Graph Theory"},{"key":"25_CR2","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0166-218X(88)90120-5","volume":"22","author":"G.J. Chang","year":"1988","unstructured":"Chang, G.J.: Labeling algorithms for domination problems in sun-free chordal graphs. Discrete Appl. Math.\u00a022, 21\u201334 (1988\/1989)","journal-title":"Discrete Appl. Math."},{"key":"25_CR3","unstructured":"Chepoi, V., Estellon, B., Nouioua, K., Vax\u00e8s, Y.: Mixted covering of trees and the augmentation problem with mixted integer constraints (submitted)"},{"key":"25_CR4","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, 243\u2013262 (2002)","journal-title":"Algorithmica"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1002\/jgt.3190080408","volume":"8","author":"F.R.K. Chung","year":"1984","unstructured":"Chung, F.R.K., Garey, M.R.: Diameter bounds for altered graphs. J. Graph Theory\u00a08, 511\u2013534 (1984)","journal-title":"J. Graph Theory"},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/0890-5401(87)90031-9","volume":"72","author":"D. Dolev","year":"1987","unstructured":"Dolev, D., Halpern, J., Simons, B., Strong, H.R.: A new look at fault tolerant network routing. Information and Computation\u00a072, 180\u2013196 (1987)","journal-title":"Information and Computation"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1137\/0205044","volume":"5","author":"K.P. Eswaran","year":"1976","unstructured":"Eswaran, K.P., Tarjan, R.E.: Augmentation problems. SIAM J. Computing\u00a05, 653\u2013665 (1976)","journal-title":"SIAM J. Computing"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1142\/S0129626493000423","volume":"3","author":"A.M. Farley","year":"1993","unstructured":"Farley, A.M., Proskurowski, A.: Self-repairing networks. Parallel Processing Letters\u00a03, 381\u2013391 (1993)","journal-title":"Parallel Processing Letters"},{"key":"25_CR9","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"25_CR10","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)"},{"key":"25_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1007\/BFb0028270","volume-title":"Algorithms and Data Structures","author":"G. Kant","year":"1991","unstructured":"Kant, G., Bodlaender, H.L.: Planar graph augmentation problems. In: Dehne, F., Sack, J.-R., Santoro, N. (eds.) WADS 1991. LNCS, vol.\u00a0519, pp. 286\u2013298. Springer, Heidelberg (1991)"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/0167-6377(92)90007-P","volume":"11","author":"C.-L. Ch","year":"1992","unstructured":"Ch, C.-L., McCormick, S.T., Simchi\u2013Levi, D.: On the minimum-cardinality-bounded-diameter and the bounded-cardinality-minimum-diameter edge addition problems. Operations Research Letters\u00a011, 303\u2013308 (1992)","journal-title":"Operations Research Letters"},{"key":"25_CR13","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. J. Graph Theory\u00a011, 409\u2013427 (1987)","journal-title":"J. Graph Theory"},{"key":"25_CR14","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Berlin (2001)"},{"key":"25_CR15","volume-title":"Introduction to Graph Theory","author":"D.B. West","year":"2001","unstructured":"West, D.B.: Introduction to Graph Theory. Prentice Hall, London (2001)"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:09:57Z","timestamp":1605643797000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11534273_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}