{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,31]],"date-time":"2022-03-31T02:00:00Z","timestamp":1648692000473},"reference-count":16,"publisher":"Elsevier BV","issue":"1-3","license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"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":5676,"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":[[1998,1]]},"DOI":"10.1016\/s0166-218x(97)00099-1","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T17:35:45Z","timestamp":1027618545000},"page":"239-261","source":"Crossref","is-referenced-by-count":1,"title":["Better approximations of non-Hamiltonian graphs"],"prefix":"10.1016","volume":"81","author":[{"given":"Kazuo","family":"Iwama","sequence":"first","affiliation":[]},{"given":"Eiji","family":"Miyano","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(97)00099-1_bib1","first-page":"377","article-title":"Random generation of test instances with controlled attributes","volume":"vol. 26","author":"Asahiro","year":"1996"},{"key":"10.1016\/S0166-218X(97)00099-1_bib2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1016\/0166-218X(90)90001-S","article-title":"Recognizing tough graphs is NP-hard","volume":"28","author":"Bauer","year":"1990","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0166-218X(97)00099-1_bib3","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1016\/S0019-9958(82)90439-9","article-title":"On the unique satisfiability problem","volume":"55","author":"Blass","year":"1982","journal-title":"Inform. Control"},{"key":"10.1016\/S0166-218X(97)00099-1_bib4","series-title":"Proc. 8th IEEE Conference on Structure in Complexity Theory","first-page":"313","article-title":"The complexity of selecting maximal solutions","author":"Chen","year":"1993"},{"key":"10.1016\/S0166-218X(97)00099-1_bib5","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0012-365X(73)90138-6","article-title":"Tough graphs and hamiltonian cycles","volume":"5","author":"Chv\u00e1tal","year":"1973","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(97)00099-1_bib6","series-title":"The Travelling Salesman Problem","first-page":"403","article-title":"Hamiltonian cycles","author":"Chv\u00e1tal","year":"1985"},{"key":"10.1016\/S0166-218X(97)00099-1_bib7","series-title":"Second DIMACS Challenge","article-title":"SAT versus UNSAT","author":"Dubois","year":"1993"},{"key":"10.1016\/S0166-218X(97)00099-1_bib8","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1002\/jgt.3190090106","article-title":"Toughness and the existence ofk-factors","volume":"9","author":"Enomoto","year":"1985","journal-title":"J. Graph Theory"},{"key":"10.1016\/S0166-218X(97)00099-1_bib9","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0166-218X(97)00099-1_bib10","series-title":"Proc. 12th IFIP World Computer Congress","first-page":"322","article-title":"Random generation of satisfiable and unsatisfiable CNF predicates","author":"Iwama","year":"1992"},{"key":"10.1016\/S0166-218X(97)00099-1_bib11","series-title":"Proc. AAAI Spring Symposium Series","first-page":"85","article-title":"Security of test-case generation with known answers","author":"Iwama","year":"1993"},{"key":"10.1016\/S0166-218X(97)00099-1_bib12","series-title":"Proc. 10th IEEE Conference on Structure in Complexity Theory","first-page":"29","article-title":"Intractability of read-once resolution","author":"Iwama","year":"1995"},{"key":"10.1016\/S0166-218X(97)00099-1_bib13","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1137\/0215027","article-title":"Optimal approximations and polynomially levelable sets","volume":"15","author":"Orponen","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0166-218X(97)00099-1_bib14","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/0022-0000(84)90068-0","article-title":"The complexity of facets (and some facets of complexity)","volume":"28","author":"Papadimitriou","year":"1984","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(97)00099-1_bib15","doi-asserted-by":"crossref","first-page":"2","DOI":"10.1016\/0022-0000(88)90042-6","article-title":"The complexity of facets resolved","volume":"37","author":"Papadimitriou","year":"1988","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0166-218X(97)00099-1_bib16","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0166-218X(93)E0140-T","article-title":"Generating hard and diverse test sets for NP-hard graph problems","volume":"58","author":"Sanchis","year":"1995","journal-title":"Discrete Appl. Math."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000991?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X97000991?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T18:50:44Z","timestamp":1556131844000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X97000991"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,1]]},"references-count":16,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1998,1]]}},"alternative-id":["S0166218X97000991"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(97)00099-1","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1998,1]]}}}