{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T07:20:49Z","timestamp":1768634449244,"version":"3.49.0"},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"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":8843,"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":[[1989,5]]},"DOI":"10.1016\/0166-218x(89)90025-5","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:43:01Z","timestamp":1027654981000},"page":"157-178","source":"Crossref","is-referenced-by-count":44,"title":["Local optimization on graphs"],"prefix":"10.1016","volume":"23","author":[{"given":"Donna Crystal","family":"Llewellyn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Craig","family":"Tovey","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Trick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(89)90025-5_BIB1","article-title":"Minimization algorithms and random walk on the d-cube","author":"Aldous","year":"1981","journal-title":"Tech. Rept., University of California, Berkeley, CA"},{"key":"10.1016\/0166-218X(89)90025-5_BIB2","doi-asserted-by":"crossref","first-page":"494","DOI":"10.4153\/CJM-1965-048-6","article-title":"The genus of the n-cube","volume":"17","author":"Beineke","year":"1965","journal-title":"Canad. J. Math."},{"key":"10.1016\/0166-218X(89)90025-5_BIB3","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/S0021-9800(67)80026-7","article-title":"Lengths of snakes in boxes","volume":"2","author":"Danzer","year":"1967","journal-title":"J. Combinat. Theory"},{"key":"10.1016\/0166-218X(89)90025-5_BIB4","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1137\/0603022","article-title":"On the problem of partitioning planar graphs","author":"Djidjev","year":"1982","journal-title":"SIAM J. Alg. Dis. Meth."},{"issue":"2","key":"10.1016\/0166-218X(89)90025-5_BIB5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1137\/0205015","article-title":"Multidimensional searching problems","volume":"5","author":"Dobkin","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0166-218X(89)90025-5_BIB6","volume":"1","author":"Feller","year":"1971"},{"key":"10.1016\/0166-218X(89)90025-5_BIB7","series-title":"Computers and Intractibility: A Guide to the Theory of NP-Completeness","author":"Garey","year":"1979"},{"issue":"3","key":"10.1016\/0166-218X(89)90025-5_BIB8","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1016\/0196-6774(84)90019-1","article-title":"A separator theorem for graphs of bounded genus","volume":"5","author":"Gilbert","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0166-218X(89)90025-5_BIB9","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0012-365X(78)90097-3","article-title":"Lower bounds on the worst-case complexity of some oracle algorithms","volume":"24","author":"Hausmann","year":"1978","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(89)90025-5_BIB10","series-title":"Proceeding IEEE Symposium on the Foundations of Computer Science","first-page":"39","article-title":"How easy is local search?","author":"Johnson","year":"1985"},{"key":"10.1016\/0166-218X(89)90025-5_BIB11","unstructured":"G. Leuker, Unpublished manuscript, Princeton University, Princeton, NJ (1976)."},{"issue":"2","key":"10.1016\/0166-218X(89)90025-5_BIB12","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1137\/0716027","article-title":"Generalized nested dissection","volume":"16","author":"Lipton","year":"1979","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"10.1016\/0166-218X(89)90025-5_BIB13","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1007\/BF02592948","article-title":"Some NP-complete problems in quadratic and nonlinear programming","volume":"39","author":"Murty","year":"1987","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(89)90025-5_BIB14","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1287\/moor.3.3.177","article-title":"Best algorithms for approximating the maximum of a submodular set function","volume":"3","author":"Nemhauser","year":"1978","journal-title":"Math. Oper. Res."},{"key":"10.1016\/0166-218X(89)90025-5_BIB15","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1016\/0166-218X(89)90025-5_BIB16","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF02993245","article-title":"Das Geschlecht des Vollst\u00e4ndigen Paaren Graphen","volume":"28","author":"Ringel","year":"1965","journal-title":"A.B.H. Math. Sem. Univ. Hamburg"},{"key":"10.1016\/0166-218X(89)90025-5_BIB17","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1016\/0166-218X(84)90081-7","article-title":"A simplified NP-complete satisfiability problem","volume":"8","author":"Tovey","year":"1984","journal-title":"Discrete Appl. Math."},{"issue":"2","key":"10.1016\/0166-218X(89)90025-5_BIB18","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01580647","article-title":"Low order polynomial bounds on the expected performance of local improvement algorithms","volume":"35","author":"Tovey","year":"1986","journal-title":"Math. Programming"},{"key":"10.1016\/0166-218X(89)90025-5_BIB19","article-title":"Multidimensional bisection and global minimization","author":"Wood","year":"1985","journal-title":"Tech. Rept., University of Canterbury"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X89900255?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X89900255?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:55:31Z","timestamp":1555134931000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X89900255"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["0166218X89900255"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(89)90025-5","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}