{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T13:12:38Z","timestamp":1773925958659,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540709176","type":"print"},{"value":"9783540709183","type":"electronic"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-70918-3_45","type":"book-chapter","created":{"date-parts":[[2007,5,23]],"date-time":"2007-05-23T23:41:23Z","timestamp":1179963683000},"page":"524-535","source":"Crossref","is-referenced-by-count":8,"title":["On Completing Latin Squares"],"prefix":"10.1007","author":[{"given":"Iman","family":"Hajirasouliha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hossein","family":"Jowhari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ravi","family":"Sundaram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","doi-asserted-by":"crossref","unstructured":"Barry, R.A., Humblet, P.A.: Latin routers, design and implementation. IEEE\/OSA Journal of Lightwave Technology, 891\u2013899 (1993)","DOI":"10.1109\/50.233253"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/0166-218X(84)90075-1","volume":"8","author":"C.J. Colbourn","year":"1984","unstructured":"Colbourn, C.J.: The complexity of completing partial latin squares. Discrete Applied Mathematics\u00a08, 25\u201330 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"45_CR3","doi-asserted-by":"publisher","first-page":"958","DOI":"10.2307\/2309221","volume":"67","author":"T. Evans","year":"1960","unstructured":"Evans, T.: Embedding incomplete latin squares. American Mathematical Monthly\u00a067, 958\u2013961 (1960)","journal-title":"American Mathematical Monthly"},{"issue":"4","key":"45_CR4","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"issue":"5","key":"45_CR5","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.orl.2003.09.007","volume":"32","author":"C.P. Gomes","year":"2004","unstructured":"Gomes, C.P., Regis, R.G., Shmoys, D.B.: An improved approximation algorithm for the partial latin square extension problem. Operations Research Letters\u00a032(5), 479\u2013484 (2004)","journal-title":"Operations Research Letters"},{"key":"45_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-97881-4","volume-title":"Geometric Algorithms and Combinatorial Optimization","author":"M. Gr\u00f6tschel","year":"1988","unstructured":"Gr\u00f6tschel, M., Lov\u00e1sz, L., Schrijver, A.: Geometric Algorithms and Combinatorial Optimization. Springer, Heidelberg (1988)"},{"issue":"4","key":"45_CR7","doi-asserted-by":"publisher","first-page":"713","DOI":"10.1137\/0210054","volume":"10","author":"I. Holyer","year":"1981","unstructured":"Holyer, I.: The NP-completeness of some edge-partition problems. SIAM Journal on Computing\u00a010(4), 713\u2013717 (1981)","journal-title":"SIAM Journal on Computing"},{"issue":"1","key":"45_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C.A.J. Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal on Discrete Mathematics\u00a02(1), 68\u201372 (1989)","journal-title":"SIAM Journal on Discrete Mathematics"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Immorlica, N., Mahdian, M., Mirrokni, V.S.: Cycle cover with short cycles. In: Proceedings of the 22nd Annual Symposium on Theoretical Aspects of Computer Science, pp. 641\u2013653 (2005)","DOI":"10.1007\/978-3-540-31856-9_53"},{"issue":"2","key":"45_CR10","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1007\/PL00009274","volume":"24","author":"R. Kumar","year":"1999","unstructured":"Kumar, R., Russell, A., Sundaram, R.: Approximating latin square extensions. Algorithmica\u00a024(2), 128\u2013138 (1999)","journal-title":"Algorithmica"},{"issue":"4","key":"45_CR11","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF02579324","volume":"7","author":"P. Raghavan","year":"1987","unstructured":"Raghavan, P., Thompson, C.D.: Randomized rounding: A technique for provably good algorithms and algorithmic proofs. Combinatorica\u00a07(4), 365\u2013374 (1987)","journal-title":"Combinatorica"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"550","DOI":"10.2307\/2032005","volume":"2","author":"H.J. Ryser","year":"1951","unstructured":"Ryser, H.J.: A combinatorial theorem with an application to latin rectangles. Proceedings of the American Mathematical Society\u00a02, 550\u2013552 (1951)","journal-title":"Proceedings of the American Mathematical Society"},{"key":"45_CR13","first-page":"155","volume":"XI","author":"B. Smetaniuk","year":"1981","unstructured":"Smetaniuk, B.: A new construction on Latin squares I. A proof of the Evans conjecture. Ars Combinatoria\u00a0XI, 155\u2013172 (1981)","journal-title":"Ars Combinatoria"},{"key":"45_CR14","volume-title":"A Course in Combinatorics","author":"J.H. Lint van","year":"1992","unstructured":"van Lint, J.H., Wilson, R.M.: A Course in Combinatorics. Cambridge University Press, Cambridge (1992)"}],"container-title":["Lecture Notes in Computer Science","STACS 2007"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70918-3_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:36:23Z","timestamp":1558272983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70918-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540709176","9783540709183"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70918-3_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007]]}}}