{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T12:04:30Z","timestamp":1762430670290},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642317699"},{"type":"electronic","value":"9783642317705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31770-5_17","type":"book-chapter","created":{"date-parts":[[2012,7,26]],"date-time":"2012-07-26T05:03:12Z","timestamp":1343278992000},"page":"188-199","source":"Crossref","is-referenced-by-count":4,"title":["An Improved Approximation Algorithm for the Bandpass-2 Problem"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10878-008-9143-3","volume":"18","author":"D.A. Babayev","year":"2009","unstructured":"Babayev, D.A., Bell, G.I., Nuriyev, U.G.: The Bandpass Problem: Combinatorial Optimization and Library of Problems. Journal of Combinatorial Optimization\u00a018, 151\u2013172 (2009)","journal-title":"Journal of Combinatorial Optimization"},{"key":"17_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/3-540-69346-7_15","volume-title":"Integer Programming and Combinatorial Optimization","author":"A. Barvinok","year":"1998","unstructured":"Barvinok, A., Johnson, D.S., Woeginger, G.J., Woodroofe, R.: The Maximum Traveling Salesman Problem Under Polyhedral Norms. In: Bixby, R.E., Boyd, E.A., R\u00edos-Mercado, R.Z. (eds.) IPCO 1998. LNCS, vol.\u00a01412, pp. 195\u2013201. Springer, Heidelberg (1998)"},{"key":"17_CR3","unstructured":"Bell, G.I., Babayev, D.A.: Bandpass Problem. In: Annual INFORMS Meeting, Denver, CO, USA (2004)"},{"key":"17_CR4","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s10878-006-9023-7","volume":"13","author":"Z.-Z. Chen","year":"2007","unstructured":"Chen, Z.-Z., Nagoya, T.: Improved Approximation Algorithms for Metric Max TSP. Journal of Combinatorial Optimization\u00a013, 321\u2013336 (2007)","journal-title":"Journal of Combinatorial Optimization"},{"key":"17_CR5","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1016\/j.ipl.2005.03.011","volume":"95","author":"Z.-Z. Chen","year":"2005","unstructured":"Chen, Z.-Z., Okamoto, Y., Wang, L.: Improved deterministic approximation algorithms for Max TSP. Information Processing Letters\u00a095, 333\u2013342 (2005)","journal-title":"Information Processing Letters"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/s10878-005-1779-7","volume":"9","author":"Z.-Z. Chen","year":"2005","unstructured":"Chen, Z.-Z., Wang, L.: An Improved Randomized Approximation Algorithm for Max TSP. Journal of Combinatorial Optimization\u00a09, 401\u2013432 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"key":"17_CR7","unstructured":"Gabow, H.: Implementation of Algorithms for Maximum Matching on Nonbipartite Graphs. Ph.D. Thesis, Department of Computer Science, Stanford University, Stanford, California (1973)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Gabow, H.: An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC 1983, pp. 448\u2013456. ACM (1983)","DOI":"10.1145\/800061.808776"},{"key":"17_CR9","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0020-0190(98)00102-1","volume":"67","author":"R. Hassin","year":"1998","unstructured":"Hassin, R., Rubinstein, S.: An Approximation Algorithm for the Maximum Traveling Salesman Problem. Information Processing Letters\u00a067, 125\u2013130 (1998)","journal-title":"Information Processing Letters"},{"key":"17_CR10","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0020-0190(00)00097-1","volume":"75","author":"R. Hassin","year":"2000","unstructured":"Hassin, R., Rubinstein, S.: Better Approximations for Max\u00a0TSP. Information Processing Letters\u00a075, 181\u2013186 (2000)","journal-title":"Information Processing Letters"},{"key":"17_CR11","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/S0020-0190(01)00234-4","volume":"81","author":"R. Hassin","year":"2002","unstructured":"Hassin, R., Rubinstein, S.: A 7\/8-Approximation Approximations for Metric Max\u00a0TSP. Information Processing Letters\u00a081, 247\u2013251 (2002)","journal-title":"Information Processing Letters"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"602","DOI":"10.1145\/1082036.1082041","volume":"52","author":"H. Kaplan","year":"2005","unstructured":"Kaplan, H., Lewenstein, M., Shafrir, N., Sviridenko, M.: Approximation Algorithms for Asymmetric TSP by Decomposing Directed Regular Multigraphs. Journal of the ACM\u00a052, 602\u2013626 (2005)","journal-title":"Journal of the ACM"},{"key":"17_CR13","first-page":"55","volume":"26","author":"A.V. Kostochka","year":"1985","unstructured":"Kostochka, A.V., Serdyukov, A.I.: Polynomial Algorithms with the Estimates \n                  \n                    \n                  \n                  $\\frac{3}{4}$\n                 and \n                  \n                    \n                  \n                  $\\frac{5}{6}$\n                 for the Traveling Salesman Problem of Maximum. Upravlyaemye Sistemy\u00a026, 55\u201359 (1985) (in Russian)","journal-title":"Upravlyaemye Sistemy"},{"key":"17_CR14","doi-asserted-by":"publisher","first-page":"5000","DOI":"10.1016\/j.tcs.2009.07.051","volume":"410","author":"L. Kowalik","year":"2009","unstructured":"Kowalik, L., Mucha, M.: Deterministic 7\/8-Approximation for the Metric Maximum TSP. Theor. Comput. Sci.\u00a0410, 5000\u20135009 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1007\/s10878-009-9273-2","volume":"22","author":"G. Lin","year":"2011","unstructured":"Lin, G.: On the Bandpass Problem. Journal of Combinatorial Optimization\u00a022, 71\u201377 (2011)","journal-title":"Journal of Combinatorial Optimization"},{"key":"17_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-03685-9_23","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"K. Paluch","year":"2009","unstructured":"Paluch, K., Mucha, M., M\u0105dry, A.: A 7\/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX 2009. LNCS, vol.\u00a05687, pp. 298\u2013311. Springer, Heidelberg (2009)"},{"key":"17_CR17","first-page":"80","volume":"25","author":"A.I. Serdyukov","year":"1984","unstructured":"Serdyukov, A.I.: An Algorithm with an Estimate for the Traveling Salesman Problem of Maximum. Upravlyaemye Sistemy\u00a025, 80\u201386 (1984) (in Russian)","journal-title":"Upravlyaemye Sistemy"},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1145\/321879.321884","volume":"225","author":"R.E. Tarjan","year":"1975","unstructured":"Tarjan, R.E.: Efficiency of a Good But Not Linear Set Union Algorithm. Journal of the ACM\u00a0225, 215\u2013225 (1975)","journal-title":"Journal of the ACM"},{"key":"17_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-642-29700-7_32","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"W. Tong","year":"2012","unstructured":"Tong, W., Goebel, R., Ding, W., Lin, G.: An Improved Approximation Algorithm for the Bandpass Problem. In: Snoeyink, J., Lu, P., Su, K., Wang, L. (eds.) AAIM 2012 and FAW 2012. LNCS, vol.\u00a07285, pp. 351\u2013358. Springer, Heidelberg (2012)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31770-5_17.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:47:42Z","timestamp":1620128862000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31770-5_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642317699","9783642317705"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31770-5_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}