{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T12:30:39Z","timestamp":1759667439879},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,10,21]],"date-time":"2009-10-21T00:00:00Z","timestamp":1256083200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2010,1]]},"DOI":"10.1007\/s11590-009-0152-7","type":"journal-article","created":{"date-parts":[[2009,10,20]],"date-time":"2009-10-20T09:26:58Z","timestamp":1256030818000},"page":"7-16","source":"Crossref","is-referenced-by-count":10,"title":["The approximability of three-dimensional assignment problems with bottleneck objective"],"prefix":"10.1007","volume":"4","author":[{"given":"Dries","family":"Goossens","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Polyakovskiy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frits C. R.","family":"Spieksma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gerhard J.","family":"Woeginger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,10,21]]},"reference":[{"key":"152_CR1","doi-asserted-by":"crossref","unstructured":"Burkard, R., Dell\u2019Amico, M., Martello, S.: Assignment problems. SIAM (2009)","DOI":"10.1137\/1.9780898717754"},{"key":"152_CR2","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1016\/0377-2217(92)90078-N","volume":"60","author":"Y. Crama","year":"1992","unstructured":"Crama Y., Spieksma F.C.R.: Approximation algorithms for three-dimensional assignment problems with triangle inequalities. Eur. J. Oper. Res. 60, 273\u2013279 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"152_CR3","volume-title":"Graph Drawing: Algorithms for the Visualization of Graphs","author":"G. Battista di","year":"1999","unstructured":"di Battista G., Eades P., Tamassia R., Tollis I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Upper Saddle River (1999)"},{"key":"152_CR4","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1016\/0196-6774(86)90002-7","volume":"7","author":"M.E. Dyer","year":"1986","unstructured":"Dyer M.E., Frieze A.M.: Planar 3DM is NP-complete. J. Algorithms 7, 174\u2013184 (1986)","journal-title":"J. Algorithms"},{"key":"152_CR5","doi-asserted-by":"crossref","unstructured":"Feder, T., Greene, D.H.: Optimal algorithms for approximate clustering. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 434\u2013444 (1988)","DOI":"10.1145\/62212.62255"},{"key":"152_CR6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0304-3975(85)90224-5","volume":"38","author":"T.F. Gonz\u00e1lez","year":"1985","unstructured":"Gonz\u00e1lez T.F.: Clustering to minimize the maximum intercluster distance. Theor. Comput. Sci. 38, 293\u2013306 (1985)","journal-title":"Theor. Comput. Sci."},{"key":"152_CR7","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1145\/5925.5933","volume":"33","author":"D.S. Hochbaum","year":"1986","unstructured":"Hochbaum D.S., Shmoys D.B.: A unified approach to approximation algorithms for bottleneck problems. J. ACM 33, 533\u2013550 (1986)","journal-title":"J. ACM"},{"key":"152_CR8","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/3-540-61576-8_80","volume":"1120","author":"B. Klinz","year":"1996","unstructured":"Klinz B., Woeginger G.J.: A new efficiently solvable special case of the three-dimensional axial bottleneck assignment problem. Lect. Notes Comput. Sci. 1120, 150\u2013162 (1996)","journal-title":"Lect. Notes Comput. Sci."},{"key":"152_CR9","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1080\/02331938508843013","volume":"16","author":"R. Malhotra","year":"1985","unstructured":"Malhotra R., Bhatia H.L., Puri M.C.: The three-dimensional bottleneck assignment problem and its variants. Optimization 16, 245\u2013256 (1985)","journal-title":"Optimization"},{"key":"152_CR10","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/S0166-218X(96)00128-X","volume":"76","author":"M. Queyranne","year":"1997","unstructured":"Queyranne M., Spieksma F.C.R.: Approximation algorithms for multi-index transportation problems with decomposable costs. Discret. Appl. Math. 76, 239\u2013253 (1997)","journal-title":"Discret. Appl. Math."},{"key":"152_CR11","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/0377-2217(95)00003-8","volume":"91","author":"F.C.R. Spieksma","year":"1996","unstructured":"Spieksma F.C.R., Woeginger G.J.: Geometric three-dimensional assignment problems. Eur. J. Oper. Res. 91, 611\u2013618 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"152_CR12","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1057\/jors.1990.55","volume":"41","author":"M.N. Vartak","year":"1990","unstructured":"Vartak M.N., Geetha S.: Specially structured precedence constraints in three-dimensional bottleneck assignment problems. J. Oper. Res. Soc. 41, 339\u2013344 (1990)","journal-title":"J. Oper. Res. Soc."},{"key":"152_CR13","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1007\/s00453-001-0089-4","volume":"32","author":"L. Wang","year":"2002","unstructured":"Wang L., Du D.-Z.: Approximations for a bottleneck Steiner tree problem. Algorithmica 32, 554\u2013561 (2002)","journal-title":"Algorithmica"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-009-0152-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-009-0152-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-009-0152-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,3]],"date-time":"2019-06-03T15:15:04Z","timestamp":1559574904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-009-0152-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,10,21]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2010,1]]}},"alternative-id":["152"],"URL":"https:\/\/doi.org\/10.1007\/s11590-009-0152-7","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,10,21]]}}}