{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T12:03:54Z","timestamp":1762430634464},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642296994"},{"type":"electronic","value":"9783642297007"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-29700-7_32","type":"book-chapter","created":{"date-parts":[[2012,4,28]],"date-time":"2012-04-28T12:25:56Z","timestamp":1335615956000},"page":"351-358","source":"Crossref","is-referenced-by-count":3,"title":["An Improved Approximation Algorithm for the Bandpass Problem"],"prefix":"10.1007","author":[{"given":"Weitian","family":"Tong","sequence":"first","affiliation":[]},{"given":"Randy","family":"Goebel","sequence":"additional","affiliation":[]},{"given":"Wei","family":"Ding","sequence":"additional","affiliation":[]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1287\/moor.23.3.640","volume":"23","author":"E.M. Arkin","year":"1998","unstructured":"Arkin, E.M., Hassin, R.: On local search for weighted packing problems. Mathematics of Operations Research\u00a023, 640\u2013648 (1998)","journal-title":"Mathematics of Operations Research"},{"key":"32_CR2","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":"32_CR3","unstructured":"Bell, G.I., Babayev, D.A.: Bandpass problem. In: Annual INFORMS Meeting, Denver, CO, USA (October 2004)"},{"key":"32_CR4","unstructured":"Chandra, B., Halld\u00f3rsson, M.M.: Greedy local improvement and weighted set packing approximation. In: ACM-SIAM Proceedings of the Tenth Annual Symposium on Discrete Algorithms (SODA 1999), pp. 169\u2013176 (1999)"},{"key":"32_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":"32_CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-completeness. W. H. Freeman and Company, San Francisco (1979)"},{"key":"32_CR7","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 TSP. Information Processing Letters\u00a075, 181\u2013186 (2000)","journal-title":"Information Processing Letters"},{"key":"32_CR8","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":"32_CR9","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":"32_CR10","first-page":"80","volume":"25","author":"A.I. Serdyukov","year":"1984","unstructured":"Serdyukov, A.I.: An algorithms for with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy\u00a025, 80\u201386 (1984)","journal-title":"Upravlyaemye Sistemy"},{"key":"32_CR11","first-page":"25","volume":"3","author":"V.G. Vizing","year":"1964","unstructured":"Vizing, V.G.: On an estimate of the chromatic class of a p-graph. Diskretnogo Analiza\u00a03, 25\u201330 (1964)","journal-title":"Diskretnogo Analiza"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-29700-7_32.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:14:07Z","timestamp":1620126847000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-29700-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642296994","9783642297007"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-29700-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}