{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:29:32Z","timestamp":1725488972876},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540699941"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-69995-8_36","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T12:28:21Z","timestamp":1186748901000},"page":"215-220","source":"Crossref","is-referenced-by-count":1,"title":["Polynomial Algorithms for Some Hard Problems of Finding Connected Spanning Subgraphs of Extreme Total Edge Weight"],"prefix":"10.1007","author":[{"given":"Alexey","family":"Baburin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Edward","family":"Gimadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"36_CR1","first-page":"10","volume":"13","author":"A. Ageev","year":"2006","unstructured":"Ageev A., Baburin A, Gimadi E. (2006) Polynomial algorithm with performance guarantee of 3\/4 for a problem of finding two edge-disjoint Hamiltonian circuits of maximal total edge weight (in russian). Discrete analysis and oper. research. Ser. 1., V. 13,2:10\u201320.","journal-title":"Discrete analysis and oper. research. Ser. 1"},{"issue":"4","key":"36_CR2","first-page":"23","volume":"9","author":"E. Baburin","year":"2002","unstructured":"Baburin E., Gimadi E. (2002) On asymptotical optimality of algoritm for solving maximum weight Euclidean TSP (in russian). Discrete analysis and operations research. Ser. 1., V. 9,4: 23\u201332.","journal-title":"Discrete analysis and operations research. Ser. 1"},{"issue":"1","key":"36_CR3","first-page":"11","volume":"11","author":"A. Baburin","year":"2004","unstructured":"Baburin A., Gimadi E., Korkishko N. (2004) Approximation algorithms for finding two edge-disjoint Hamiltonian circuits of minimal total edge weight (in russian). Discrete analysis and oper. research. Ser. 2., V. 11,1:11\u201325.","journal-title":"Discrete analysis and oper. research. Ser. 2"},{"key":"36_CR4","first-page":"343","volume-title":"Oper. Res. Proc. 2004, Intern. Conf. OR 2004","author":"E. Baburin","year":"2005","unstructured":"Baburin E., Gimadi E. (2005) Approximation algorithms for finding a maximum-weight spanning connected subgraph with given vertex degrees. Oper. Res. Proc. 2004, Intern. Conf. OR 2004, Tilburg. Springer, Berlin, 343\u2013351."},{"doi-asserted-by":"crossref","unstructured":"Berman P., Karpinski M. (2006) 8\/7-approximation algorithm for (1,2)-TSP. Proc. 17th ACM-SIAM SODA, 641\u2013648.","key":"36_CR5","DOI":"10.1145\/1109557.1109627"},{"unstructured":"Croce F.D., Pashos V.Th., Calvo R.W. (2005) Approximating the 2-peripatetic salesman problem. 7th Workshop on Modelling and Algorithms for Planning and Scheduling Problems MAPS 2005. (Siena, Italy, June 6\u201310). 114\u2013116.","key":"36_CR6"},{"issue":"1","key":"36_CR7","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1080\/02331939108843650","volume":"22","author":"J.B. J.M. Kort De","year":"1991","unstructured":"De Kort J.B. J.M. (1991) Lower bounds for symmetric K-peripatetic salesman problems. Optimization. V. 22,1: 113\u2013122.","journal-title":"Optimization"},{"key":"36_CR8","first-page":"89","volume-title":"Matchings: a well solvable class of integer linear programs","author":"J. Edmonds","year":"1970","unstructured":"Edmonds J., Johnson E. L. (1970) Matchings: a well solvable class of integer linear programs. Combinatorial Structures and Their Applications. New York: Gordon and Breach. 89\u201392."},{"key":"36_CR9","first-page":"448","volume-title":"Proc. 15th annual ACM symposium on theory of computing","author":"H. N. Gabow","year":"1983","unstructured":"Gabow H. N. (1983) An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems. Proc. 15th annual ACM symposium on theory of computing, (Boston, April 25\u201327, 1983). New York: ACM, 448\u2013456."},{"key":"36_CR10","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-3-642-56656-1_9","volume-title":"Oper. Res. Proceed. 2000","author":"E.Kh. Gimadi","year":"2001","unstructured":"Gimadi E.Kh., Serdyukov A.I. (2001) Problem of Finding the Maximal Spanning Connected Subgraph with Given Vertex Degrees. Oper. Res. Proceed. 2000 (Eds Fleishman B. at al.) Springer, Berlin, 55\u201359."},{"key":"36_CR11","doi-asserted-by":"crossref","first-page":"477","DOI":"10.21136\/CPM.1955.108220","volume":"80","author":"V. Havel","year":"1955","unstructured":"Havel V. (1955) A note to question of existance of finite graphs, Casopis Pest Mat, V. 80, 477\u2013480.","journal-title":"Casopis Pest Mat"},{"key":"36_CR12","doi-asserted-by":"crossref","DOI":"10.21236\/AD0705364","volume-title":"Graph Theory","author":"F. Harary","year":"1969","unstructured":"Harary F. (1969) Graph Theory, Addison-Wesley, Reading, Massachusetts."},{"unstructured":"Krarup J. (1975) The peripatetic salesman and some related unsolved problems. Combinatorial programming: methods and applications (Proc. NATO Advanced Study Inst., Versailles, 1974). 173\u2013178.","key":"36_CR13"},{"issue":"1","key":"36_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/moor.18.1.1","volume":"18","author":"C. H. Papadimitriu","year":"1993","unstructured":"Papadimitriu C. H., Yannakakis M. (1993) The traveling salesman problem with distance One and Two. Math. Oper. Res. V. 18,1:1\u201311.","journal-title":"Math. Oper. Res."},{"key":"36_CR15","first-page":"79","volume":"27","author":"A.I. Serdukov","year":"1987","unstructured":"Serdukov A.I. (1987) An Asymptoticaly Optimal Algorithm for Solving Max Euclidean TSP. Metodi Celochislennoi Optimizacii (Upravliaemie Sistemi), Novosibirsk. 27:79\u201387.","journal-title":"Novosibirsk"},{"volume-title":"The Traveling Salesman Problem and its Variations","year":"2002","unstructured":"The Traveling Salesman Problem and its Variations. Gutin G., Punnen A.P. (eds). Kluver Academic Publishers, Dordrecht \/ Boston \/ London. 2002.","key":"36_CR16"}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2006"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-69995-8_36.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,21]],"date-time":"2021-08-21T10:56:10Z","timestamp":1629543370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-69995-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540699941"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-69995-8_36","relation":{},"subject":[]}}