{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T21:26:04Z","timestamp":1770499564923,"version":"3.49.0"},"reference-count":13,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1995,5,1]],"date-time":"1995-05-01T00:00:00Z","timestamp":799286400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6652,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,5]]},"DOI":"10.1016\/0166-218x(93)e0168-x","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"137-151","source":"Crossref","is-referenced-by-count":23,"title":["Generating lower bounds for the linear arrangement problem"],"prefix":"10.1016","volume":"59","author":[{"given":"Weiguo","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anthony","family":"Vannelli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(93)E0168-X_BIB1","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1137\/0125042","article-title":"Optimal linear ordering","volume":"25","author":"Adolphson","year":"1973","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(93)E0168-X_BIB2","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/MCD.1985.6312016","article-title":"Near-optimal quadratic-based placement for a class of IC layout problems","volume":"1","author":"Blanks","year":"1985","journal-title":"IEEE Circuits Devices"},{"key":"10.1016\/0166-218X(93)E0168-X_BIB3","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1016\/0898-1221(84)90085-3","article-title":"On optimal linear arrangements of trees","volume":"10","author":"Chung","year":"1984","journal-title":"Comput. Math. Appl."},{"key":"10.1016\/0166-218X(93)E0168-X_BIB4","series-title":"Proceedings 19th Design Automation Workshop","first-page":"175","article-title":"A linear time heuristic for improving network partitions","author":"Fiduccia","year":"1982"},{"key":"10.1016\/0166-218X(93)E0168-X_BIB5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1016\/0304-3975(76)90059-1","article-title":"Some simplified NP-complete graph problems","volume":"1","author":"Garey","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0166-218X(93)E0168-X_BIB6","article-title":"Minimal placing of trees on a line","author":"Goldberg","year":"1976"},{"key":"10.1016\/0166-218X(93)E0168-X_BIB7","first-page":"551","article-title":"Multi-terminal network flows","volume":"9","author":"Gomory","year":"1961","journal-title":"J. SIAM"},{"key":"10.1016\/0166-218X(93)E0168-X_BIB8","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1287\/mnsc.17.3.219","article-title":"An r-dimensional quadratic placement algorithm","volume":"17","author":"Hall","year":"1970","journal-title":"Management Sci."},{"key":"10.1016\/0166-218X(93)E0168-X_BIB9","first-page":"131","article-title":"Optimal assignment of numbers to vertices","volume":"12","author":"Harper","year":"1961","journal-title":"J. SIAM"},{"key":"10.1016\/0166-218X(93)E0168-X_BIB10","doi-asserted-by":"crossref","first-page":"675","DOI":"10.1109\/TCS.1979.1084695","article-title":"One dimensional logic gate assignment and interval graphs","volume":"26","author":"Ohtsuki","year":"1979","journal-title":"IEEE Trans. Circuits Systems"},{"key":"10.1016\/0166-218X(93)E0168-X_BIB11","series-title":"Proceedings 1st IEEE Large Scale System Symposium","article-title":"Global sequencing problems in layout design","author":"Otten","year":"1983"},{"key":"10.1016\/0166-218X(93)E0168-X_BIB12","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1137\/0208002","article-title":"A minimum linear arrangement algorithm for undirected trees","volume":"8","author":"Shiloach","year":"1979","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(93)E0168-X_BIB13","series-title":"Proceedings of 29th Midwest Symposium on Circuits and Systems","first-page":"435","article-title":"An eigenvector-based approach for multi-stack VLSI layout","author":"Vannelli","year":"1986"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0168X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X93E0168X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T21:55:06Z","timestamp":1555278906000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X93E0168X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,5]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1995,5]]}},"alternative-id":["0166218X93E0168X"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(93)e0168-x","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,5]]}}}