{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T23:32:44Z","timestamp":1767137564500,"version":"build-2238731810"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_31","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T01:42:05Z","timestamp":1405906925000},"page":"359-370","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Linear Arrangement Problems and Interval Graphs"],"prefix":"10.1007","author":[{"given":"Alain","family":"Quilliot","sequence":"first","affiliation":[]},{"given":"Djamal","family":"Rebaine","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"issue":"2","key":"31_CR1","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1051\/ro\/2009009","volume":"43","author":"S Achouri","year":"2009","unstructured":"Achouri, S., Bossart, T., Munier-Kordon, A.: A polynomial algorithm for MINDSC on a subclass of series parallel graphs. RAIRO Oper. Res. 43(2), 145\u2013156 (2009)","journal-title":"RAIRO Oper. Res."},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02592023","volume":"36","author":"F Barahona","year":"1986","unstructured":"Barahona, F., Mahjoub, A.R.: On the cut polytope. Math. Prog. 36, 157\u2013173 (1986)","journal-title":"Math. Prog."},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10479-009-0648-7","volume":"175","author":"I Charon","year":"2010","unstructured":"Charon, I., Hudry, O.: An updated survey on the linear ordering problem for weighted or unweighted tournaments. Ann. Oper. Res. 175, 107\u2013158 (2010)","journal-title":"Ann. Oper. Res."},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/0898-1221(84)90085-3","volume":"11","author":"FRK Chung","year":"1984","unstructured":"Chung, F.R.K.: On optimal linear arrangement of trees. Comp. Math.\/Appl. 11, 43\u201360 (1984)","journal-title":"Comp. Math.\/Appl."},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/11821069_24","volume-title":"Mathematical Foundations of Computer Science 2006","author":"J Cohen","year":"2006","unstructured":"Cohen, J., Fomin, F.V., Heggernes, P., Kratsch, D., Kucherov, G.: Optimal linear arrangement of interval graphs. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 267\u2013279. Springer, Heidelberg (2006)"},{"key":"31_CR6","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/0020-0190(95)00046-F","volume":"55","author":"DG Corneil","year":"1995","unstructured":"Corneil, D.G., Kim, H., Natarajan, S., Olarin, S., Sprague, A.P.: A simple linear time algorithm of unit interval graphs. Inf. Process. Lett. 55, 99\u2013104 (1995)","journal-title":"Inf. Process. Lett."},{"key":"31_CR7","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1016\/0166-218X(90)90141-X","volume":"29","author":"V Chvatal","year":"1990","unstructured":"Chvatal, V., Ebenegger, C.: A note on line digraphs and the directed Max-Cut problem. Discret. Appl. Math. 29, 165\u2013170 (1990)","journal-title":"Discret. Appl. Math."},{"key":"31_CR8","unstructured":"Even, S., Shiloach, Y.: NP-Completeness of Several Arrangement Problems, Technical Report #43, Computer Science Department, The Technion, Haifa, Israel (1975)"},{"key":"31_CR9","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York (1979) (Computer Press)"},{"key":"31_CR10","unstructured":"Grotschel, M. (ed.): The Sharpest Cut, MPS-SIAM Series on Optimization. SIAM, Philadelphia (2004)"},{"key":"31_CR11","unstructured":"Horton, S.B.: The optimal linear arrangement problem: algorithms and approximation. Ph.D. Thesis, Georgia Institute of Technology (1997)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T21:10:42Z","timestamp":1703193042000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":11,"aliases":["10.1007\/978-3-319-14115-2_31"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}