{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:56:48Z","timestamp":1725559008565},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540223399"},{"type":"electronic","value":"9783540278108"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27810-8_25","type":"book-chapter","created":{"date-parts":[[2010,7,13]],"date-time":"2010-07-13T17:27:29Z","timestamp":1279042049000},"page":"285-297","source":"Crossref","is-referenced-by-count":1,"title":["The Bottleneck Problem with Minimum Quantity Commitments"],"prefix":"10.1007","author":[{"given":"Andrew","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhou","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1006\/jagm.1993.1047","volume":"15","author":"J. Bar-Ilan","year":"1993","unstructured":"Bar-Ilan, J., Kortsarz, G., Peleg, D.: How to allocate network centers. Journal of Algorithms\u00a015(3), 385\u2013415 (1993)","journal-title":"Journal of Algorithms"},{"key":"25_CR2","first-page":"373","volume":"29","author":"Y. Bassok","year":"1997","unstructured":"Bassok, Y., Anupindi, R.: Analysis of supply contracts with total minimum commitment. IIE Trans.\u00a029, 373\u2013381 (1997)","journal-title":"IIE Trans."},{"issue":"3","key":"25_CR3","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1016\/S0020-0190(97)00224-X","volume":"65","author":"S. Chaudhuri","year":"1998","unstructured":"Chaudhuri, S., Garg, N., Ravie, R.: The p-neighbor k-center problem. Information Processing Letters\u00a065(3), 131\u2013134 (1998)","journal-title":"Information Processing Letters"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/0166-218X(83)90085-9","volume":"6","author":"R.D. Dutton","year":"1983","unstructured":"Dutton, R.D., Brigham, R.C.: A characterization of competition graphs. Discrete Appl. Math.\u00a06, 315\u2013317 (1983)","journal-title":"Discrete Appl. Math."},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"285","DOI":"10.1016\/0167-6377(85)90002-1","volume":"3","author":"M. Dyer","year":"1985","unstructured":"Dyer, M., Frieze, A.M.: A simple heuristic for the p-center problem. Operations Research Letters\u00a03, 285\u2013288 (1985)","journal-title":"Operations Research Letters"},{"key":"25_CR6","volume-title":"Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability \u2013 A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)"},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1287\/moor.10.2.180","volume":"10","author":"D. Hochbaum","year":"1985","unstructured":"Hochbaum, D., Shmoys, D.B.: A best possible heuristic for the k-center problem. Mathematics of Operations Research\u00a010, 180\u2013184 (1985)","journal-title":"Mathematics of Operations Research"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"D. Hochbaum","year":"1986","unstructured":"Hochbaum, D., Shmoys, D.B.: A unified approach to approximation algorithms for bottleneck problems. Journal of the ACM\u00a033, 533\u2013550 (1986)","journal-title":"Journal of the ACM"},{"key":"25_CR9","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/0166-218X(79)90044-1","volume":"1","author":"W. Hsu","year":"1979","unstructured":"Hsu, W., Nemhauser, G.: Easy and hard bottleneck location problems. Discrete Applied Mathematics\u00a01, 209\u2013216 (1979)","journal-title":"Discrete Applied Mathematics"},{"issue":"1\u20132","key":"25_CR10","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/S0304-3975(98)00222-9","volume":"242","author":"S. Khuller","year":"2000","unstructured":"Khuller, S., Pless, R., Sussmann, Y.J.: Fault tolerant k-center problems. Theoretical Computer Science\u00a0242(1\u20132), 237\u2013245 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"3","key":"25_CR11","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1137\/S0895480197329776","volume":"13","author":"S. Khuller","year":"2000","unstructured":"Khuller, S., Sussmann, Y.J.: The capacitated k -center problem. SIAM Journal on Discrete Mathematics\u00a013(3), 403\u2013418 (2000)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"2","key":"25_CR12","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0020-0190(95)00141-X","volume":"56","author":"S.O. Krumke","year":"1995","unstructured":"Krumke, S.O.: On a generalization of the p-center problem. Information Processing Letters\u00a056(2), 67\u201371 (1995)","journal-title":"Information Processing Letters"},{"key":"25_CR13","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1016\/0166-218X(87)90029-1","volume":"17","author":"J. Plesnik","year":"1987","unstructured":"Plesnik, J.: 1987. Discrete Applied Mathematics\u00a017, 263\u2013268 (1987)","journal-title":"Discrete Applied Mathematics"},{"key":"25_CR14","volume-title":"Approximation Algorithms","author":"V.V. Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)"},{"key":"25_CR15","unstructured":"Xu, Z., Lim, A.: The bottleneck problem with minimum quantity commitments (long version) (September 2003), \n                    \n                      http:\/\/logistics.ust.hk\/~xuzhou\/doc\/share.html"}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27810-8_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:27:08Z","timestamp":1620012428000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27810-8_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540223399","9783540278108"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27810-8_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}