{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:57:13Z","timestamp":1725555433942},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642124495"},{"type":"electronic","value":"9783642124501"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-12450-1_15","type":"book-chapter","created":{"date-parts":[[2010,5,5]],"date-time":"2010-05-05T19:01:49Z","timestamp":1273086109000},"page":"159-169","source":"Crossref","is-referenced-by-count":0,"title":["Between a Rock and a Hard Place: The Two-to-One Assignment Problem"],"prefix":"10.1007","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","reference":[{"key":"15_CR1","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/TCBB.2005.26","volume":"2","author":"P. Biyani","year":"2005","unstructured":"Biyani, P., Wu, X., Sinha, A.: Joint classification and pairing of human chromosomes. IEEE\/ACM Trans. on Comp. Biol. and Bioinf.\u00a02, 102\u2013109 (2005)","journal-title":"IEEE\/ACM Trans. on Comp. Biol. and Bioinf."},{"key":"15_CR2","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/0166-218X(95)00031-L","volume":"65","author":"R.E. Burkard","year":"1996","unstructured":"Burkard, R.E., Rudolf, R., Woeginger, G.J.: Three-dimensional axial assignment problems with decomposable cost coefficients. Discr. Appl. Math.\u00a065, 123\u2013140 (1996)","journal-title":"Discr. Appl. Math."},{"key":"15_CR3","doi-asserted-by":"publisher","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. of Oper. Res.\u00a060, 273\u2013279 (1992)","journal-title":"Eur. J. of Oper. Res."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"608","DOI":"10.2514\/1.31299","volume":"45","author":"A. Dutta","year":"2008","unstructured":"Dutta, A., Tsiotras, P.: Egalitarian peer-to-peer satellite refueling strategy. J. of Spacecraft and Rockets\u00a045, 608\u2013618 (2008)","journal-title":"J. of Spacecraft and Rockets"},{"key":"15_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. Freeman, San Francisco (1979)"},{"key":"15_CR6","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V. Kann","year":"1991","unstructured":"Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Inf. Proc. Let.\u00a037, 27\u201335 (1991)","journal-title":"Inf. Proc. Let."},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1109\/4235.850654","volume":"4","author":"G. Magyar","year":"2000","unstructured":"Magyar, G., Johnsson, M., Nevalainen, O.: An adaptive hybrid genetic algorithm for the three-matching problem. IEEE Trans. on Evol. Comp.\u00a04, 135\u2013146 (2000)","journal-title":"IEEE Trans. on Evol. Comp."},{"key":"15_CR8","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/BF01202286","volume":"4","author":"E. Petrank","year":"1994","unstructured":"Petrank, E.: The hardness of approximation: Gap location. Comp. Compl.\u00a04, 133\u2013157 (1994)","journal-title":"Comp. Compl."},{"key":"15_CR9","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A. Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Berlin (2003)"},{"key":"15_CR10","doi-asserted-by":"publisher","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. of Oper. Res.\u00a091, 611\u2013618 (1996)","journal-title":"Eur. J. of Oper. Res."},{"key":"15_CR11","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0377-2217(02)00686-0","volume":"148","author":"T. Urban","year":"2003","unstructured":"Urban, T., Russel, R.: Scheduling sport competitions on multiple venues. Eur. J. of Oper. Res.\u00a0148, 302\u2013311 (2003)","journal-title":"Eur. J. of Oper. Res."},{"unstructured":"Wilson, B.: Surf City. Liberty Records (1963)","key":"15_CR12"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-12450-1_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:41:44Z","timestamp":1619782904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-12450-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642124495","9783642124501"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-12450-1_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}