{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T13:18:50Z","timestamp":1773235130057,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540343752","type":"print"},{"value":"9783540343783","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758471_23","type":"book-chapter","created":{"date-parts":[[2006,6,2]],"date-time":"2006-06-02T10:34:15Z","timestamp":1149244455000},"page":"223-235","source":"Crossref","is-referenced-by-count":3,"title":["An Approximation Algorithm for a Bottleneck Traveling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Ming-Yang","family":"Kao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manan","family":"Sanghi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Bailey-Kellogg, C., Chainraj, S., Pandurangan, G.: A Random Graph Approach to NMR Sequential Assignment. In: Proceedings of the 8\n                    th\n                   Annual International Conference on Computational Molecular Biology, pp. 58\u201367 (2004)","DOI":"10.1145\/974614.974623"},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"192","DOI":"10.1287\/opre.36.2.192","volume":"36","author":"M.O. Ball","year":"1988","unstructured":"Ball, M.O., Magazine, M.J.: Sequencing of Insertions in Printed Circuit Board Assembly. Operations Research\u00a036, 192\u2013201 (1988)","journal-title":"Operations Research"},{"key":"23_CR3","volume-title":"Protein NMR Spectroscopy: Principles and Practice","author":"J. Cavanagh","year":"1996","unstructured":"Cavanagh, J., Fairbrother, W.J., Palmer III, A.G., Skelton, N.J.: Protein NMR Spectroscopy: Principles and Practice. Academic Press, New York (1996)"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/S0304-3975(02)00086-5","volume":"299","author":"Z.-Z. Chen","year":"2003","unstructured":"Chen, Z.-Z., Jiang, T., Lin, G., Wen, J., Xu, D., Xu, J., Xu, Y.: Approximation Algorithms for NMR Spectral Peak Assignment. Theoretical Computer Science\u00a0299, 211\u2013229 (2003)","journal-title":"Theoretical Computer Science"},{"key":"23_CR5","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 & Co., New York (1979)"},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1287\/opre.12.5.655","volume":"12","author":"P.C. Gilmore","year":"1964","unstructured":"Gilmore, P.C., Gomory, R.E.: Sequencing a One State-Variable Machine: A Solvable Case of the Traveling Salesman Problem. Operations Research\u00a012, 655\u2013679 (1964)","journal-title":"Operations Research"},{"key":"23_CR7","volume-title":"The Traveling Salesman Problem and Its Variations","author":"G. Gutin","year":"2002","unstructured":"Gutin, G., Punnen, A.P.: The Traveling Salesman Problem and Its Variations. Kluwer Academic Publishers, Dordrecht (2002)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1023\/A:1021975923026","volume":"25","author":"T.K. Hitchens","year":"2003","unstructured":"Hitchens, T.K., Lukin, J.A., Zhan, Y., McCallum, S.A., Rule, G.S.: MONTE: An Automated Monte Carlo Based Approach to Nuclear Magnetic Resonance Assignment of Proteins. Journal of Biomolecular NMR\u00a025, 1\u20139 (2003)","journal-title":"Journal of Biomolecular NMR"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1057\/jors.1972.52","volume":"23","author":"S.S. Reddi","year":"1972","unstructured":"Reddi, S.S., Ramamoorthy, C.V.: On the Flow-Shop Sequencing Problem with No Wait in Process. Operational Research Quarterly\u00a023, 323\u2013331 (1972)","journal-title":"Operational Research Quarterly"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1016\/S0167-6377(03)00050-6","volume":"31","author":"G.L. Vairaktarakis","year":"2003","unstructured":"Vairaktarakis, G.L.: On Gilmore-Gomory\u2019s open question for the bottleneck TSP. Operations Research Letters\u00a031, 483\u2013491 (2003)","journal-title":"Operations Research Letters"},{"key":"23_CR11","doi-asserted-by":"publisher","first-page":"499","DOI":"10.1023\/A:1026200209386","volume":"6","author":"G.L. Vairaktarakis","year":"2003","unstructured":"Vairaktarakis, G.L.: Simple Algorithms for Gilmore-Gomory\u2019s Traveling Salesman and Related Problems. Journal of Scheduling\u00a06, 499\u2013520 (2003)","journal-title":"Journal of Scheduling"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2202\/1544-6115.1037","volume":"3","author":"O. Vitek","year":"2004","unstructured":"Vitek, O., Vitek, J., Craig, B., Bailey-Kellogg, C.: Model-Based Assignment and Inference of Protein Backbone Nuclear Magnetic Resonances. Statistical Applications in Genetics and Molecular Biology\u00a03, 1\u201322 (2004)","journal-title":"Statistical Applications in Genetics and Molecular Biology"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Wan, X., Xu, D., Slupsky, C.M., Lin, G.: Automated Protein NMR Resonance Assignments. In: Proceedings of the 2nd IEEE Computer Society Conference on Bioinformatics, pp. 197\u2013208 (2003)","DOI":"10.1109\/CSB.2003.1227319"},{"key":"23_CR14","volume-title":"NMR of Proteins and Nucleic Acids","author":"K. W\u00fcthrich","year":"1986","unstructured":"W\u00fcthrich, K.: NMR of Proteins and Nucleic Acids. John Wiley & Sons, New York (1986)"},{"key":"23_CR15","first-page":"50","volume":"4","author":"Y. Xu","year":"2002","unstructured":"Xu, Y., Xu, D., Kim, D., Olman, V., Razumovskaya, J., Jiang, T.: Automated Assignment of Backbone NMR Peaks Using Constrained Bipartite Matching. Computing in Science and Engineering\u00a04, 50\u201362 (2002)","journal-title":"Computing in Science and Engineering"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Complexity"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758471_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:04:23Z","timestamp":1619507063000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758471_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343752","9783540343783"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/11758471_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}