{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T12:06:19Z","timestamp":1762430779823},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,9,1]],"date-time":"2013-09-01T00:00:00Z","timestamp":1377993600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2015,10]]},"DOI":"10.1007\/s10878-013-9656-2","type":"journal-article","created":{"date-parts":[[2013,8,31]],"date-time":"2013-08-31T05:15:16Z","timestamp":1377926116000},"page":"612-626","source":"Crossref","is-referenced-by-count":2,"title":["A 0.5358-approximation for Bandpass-2"],"prefix":"10.1007","volume":"30","author":[{"given":"Liqin","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Weitian","family":"Tong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Randy","family":"Goebel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tian","family":"Liu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guohui","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,9,1]]},"reference":[{"key":"9656_CR1","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0020-0190(87)90178-5","volume":"24","author":"RP Anstee","year":"1987","unstructured":"Anstee RP (1987) A polynomial algorithm for $$b$$ b -matching: an alternative approach. Inf Process Lett 24:153\u2013157","journal-title":"Inf Process Lett"},{"key":"9656_CR2","doi-asserted-by":"crossref","first-page":"640","DOI":"10.1287\/moor.23.3.640","volume":"23","author":"EM Arkin","year":"1998","unstructured":"Arkin EM, Hassin R (1998) On local search for weighted packing problems. Math Oper Res 23:640\u2013648","journal-title":"Math Oper Res"},{"key":"9656_CR3","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1007\/s10878-008-9143-3","volume":"18","author":"DA Babayev","year":"2009","unstructured":"Babayev DA, Bell GI, Nuriyev UG (2009) The bandpass problem: combinatorial optimization and library of problems. J Comb Optim 18:151\u2013172","journal-title":"J Comb Optim"},{"key":"9656_CR4","unstructured":"Bell GI, Babayev DA (2004) Bandpass problem. In: Annual INFORMS meeting, Denver, CO, USA, October 2004"},{"key":"9656_CR5","unstructured":"Chandra B, Halld\u00f3rsson MM (1999) Greedy local improvement and weighted set packing approximation. In: ACM\u2013SIAM proceedings of the tenth annual symposium on discrete algorithms (SODA\u201999), pp 169\u2013176"},{"key":"9656_CR6","doi-asserted-by":"crossref","unstructured":"Chen Z-Z, Wang L(2012) An improved approximation algorithm for the bandpass-2 problem. In: Proceedings of the 6th annual international conference on combinatorial optimization and applications (COCOA 2012), LNCS, vol 7402, pp 185\u2013196","DOI":"10.1007\/978-3-642-31770-5_17"},{"key":"9656_CR7","doi-asserted-by":"crossref","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 (2005) Improved deterministic approximation algorithms for Max TSP. Inf Process Lett 95:333\u2013342","journal-title":"Inf Process Lett"},{"key":"9656_CR8","volume-title":"Graph theory","author":"R Diestel","year":"2005","unstructured":"Diestel R (2005) Graph theory, 3rd edn. Springer, New York","edition":"3"},{"key":"9656_CR9","doi-asserted-by":"crossref","unstructured":"Gabow H (1983) 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\u201983), pp 448\u2013456","DOI":"10.1145\/800061.808776"},{"key":"9656_CR10","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"1979","unstructured":"Garey MR, Johnson DS (1979) Computers and intractability: a guide to the theory of NP-completeness. W. H. Freeman and Company, San Francisco"},{"key":"9656_CR11","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"},{"key":"9656_CR12","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/S0020-0190(00)00097-1","volume":"75","author":"R Hassin","year":"2000","unstructured":"Hassin R, Rubinstein S (2000) Better approximations for Max TSP. Inf Process Lett 75:181\u2013186","journal-title":"Inf Process Lett"},{"key":"9656_CR13","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/s10878-009-9273-2","volume":"22","author":"G Lin","year":"2011","unstructured":"Lin G (2011) On the Bandpass problem. J Comb Optim 22:71\u201377","journal-title":"J Comb Optim"},{"key":"9656_CR14","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1287\/ijoc.7.3.298","volume":"7","author":"DL Miller","year":"1995","unstructured":"Miller DL, Pekny JF (1995) A staged primal\u2013dual algorithm for perfect $$b$$ b -matching with edge capacities. ORSA J Comput 7:298\u2013320","journal-title":"ORSA J Comput"},{"key":"9656_CR15","doi-asserted-by":"crossref","unstructured":"Paluch KE, Mucha M, Madry A (2009) A 7\/9-approximation algorithm for the maximum traveling salesman problem. In: Proceedings of the 12th international workshop on APPROX and the 13th international workshop on RANDOM, LNCS, vol 5687, pp 298\u2013311","DOI":"10.1007\/978-3-642-03685-9_23"},{"key":"9656_CR16","first-page":"80","volume":"25","author":"AI Serdyukov","year":"1984","unstructured":"Serdyukov AI (1984) An algorithms for with an estimate for the traveling salesman problem of the maximum. Upravlyaemye Sistemy 25:80\u201386","journal-title":"Upravlyaemye Sistemy"},{"key":"9656_CR17","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/321879.321884","volume":"22","author":"RE Tarjan","year":"1975","unstructured":"Tarjan RE (1975) Efficiency of a good but not linear set union algorithm. J ACM 22:215\u2013225","journal-title":"J ACM"},{"key":"9656_CR18","doi-asserted-by":"crossref","unstructured":"Tong W, Goebel R, Ding W, Lin G (2012) An improved approximation algorithm for the bandpass problem. In: Proceedings of the joint conference of the sixth international frontiers of algorithmics workshop and the eighth international conference on algorithmic aspects of information and management (FAW-AAIM 2012), LNCS, vol 7285, pp 351\u2013358","DOI":"10.1007\/978-3-642-29700-7_32"},{"key":"9656_CR19","unstructured":"Tong W, Chen Z-Z, Wang L, Xu Y, Xu J, Goebel R, Lin G (2013) An approximation algorithm for the bandpass-2 problem. arXiv 1307:7089 (under review)"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9656-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-013-9656-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-013-9656-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,22]],"date-time":"2019-07-22T18:31:08Z","timestamp":1563820268000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-013-9656-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9,1]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2015,10]]}},"alternative-id":["9656"],"URL":"https:\/\/doi.org\/10.1007\/s10878-013-9656-2","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9,1]]}}}