乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T07:49:51Z","timestamp":1725436191267},"reference-count":18,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,4,1]],"date-time":"1999-04-01T00:00:00Z","timestamp":922924800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Algorithms"],"published-print":{"date-parts":[[1999,4]]},"DOI":"10.1006\/jagm.1998.0998","type":"journal-article","created":{"date-parts":[[2002,10,6]],"date-time":"2002-10-06T20:51:01Z","timestamp":1033937461000},"page":"249-268","source":"Crossref","is-referenced-by-count":20,"title":["On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs"],"prefix":"10.1006","volume":"31","author":[{"given":"Cristina","family":"Bazgan","sequence":"first","affiliation":[]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jagm.1998.0998_RF1","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, C. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, Proc. of 33rd FOCS, 1992, 14, 23","DOI":"10.1109\/SFCS.1992.267823"},{"key":"10.1006\/jagm.1998.0998_RF2","series-title":"Proc. of 26th STOC","article-title":"Color-coding: A new method for finding simple paths, cycles and other small subgraphs within large graphs","author":"Alon","year":"1994"},{"key":"10.1006\/jagm.1998.0998_RF3","series-title":"Fifth Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications","article-title":"Krawczyk's graphs show Thomason's algorithm for finding a second Hamilton cycle through a given edge in a cubic graph is exponential","author":"Cameron","year":"1998"},{"key":"10.1006\/jagm.1998.0998_RF4","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1006\/jagm.1994.1042","article-title":"Approximating the minimum-degree Steiner tree to within one of optimal","volume":"17","author":"F\u00fcrer","year":"1994","journal-title":"J. Algorithms"},{"key":"10.1006\/jagm.1998.0998_RF5","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0304-3975(96)00265-4","article-title":"On the Approximability of some Maximum Spanning Tree Problems","volume":"181","author":"Galbiati","year":"1997","journal-title":"Theoret. Comput. Sci."},{"key":"10.1006\/jagm.1998.0998_RF6","doi-asserted-by":"crossref","first-page":"704","DOI":"10.1137\/0205049","article-title":"The planar Hamiltonian circuit problem is NP-complete","volume":"5","author":"Garey","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1006\/jagm.1998.0998_RF7","series-title":"Complexity of Computer Computations","article-title":"Reducibility among combinatorial problems","author":"Karp","year":"1972"},{"key":"10.1006\/jagm.1998.0998_RF8","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1007\/BF02523689","article-title":"On Approximating the Longest Path in a Graph","volume":"18","author":"Karger","year":"1997","journal-title":"Algorithmica"},{"key":"10.1006\/jagm.1998.0998_RF9","unstructured":"A. Krawczyk, A note on the complexity of finding a second Hamiltonian cycle in cubic graphs, December 1995"},{"key":"10.1006\/jagm.1998.0998_RF10","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0304-3975(91)90200-L","article-title":"On total functions, existence theorems and computational complexity","volume":"81","author":"Megiddo","year":"1991","journal-title":"Theoretical Computer Science"},{"key":"10.1006\/jagm.1998.0998_RF11","first-page":"239","article-title":"How to find long paths efficiently","volume":"25","author":"Monien","year":"1984","journal-title":"Ann. Discrete Math."},{"key":"10.1006\/jagm.1998.0998_RF12","doi-asserted-by":"crossref","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","article-title":"On the Complexity of the Parity Argument and Other Inefficient Proofs of Existence","volume":"48","author":"Papadimitriou","year":"1994","journal-title":"J. Comput. System Sci."},{"key":"10.1006\/jagm.1998.0998_RF13","series-title":"Combinatorial Optimization: Algorithms and Complexity","author":"Papadimitriou","year":"1982"},{"key":"10.1006\/jagm.1998.0998_RF14","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","article-title":"Optimization, Approximation and Complexity Classes","volume":"43","author":"Papadimitriou","year":"1991","journal-title":"J. Comput. System Sci."},{"key":"10.1006\/jagm.1998.0998_RF15","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/moor.18.1.1","article-title":"The traveling salesman problem with distances one and two","volume":"18","author":"Papadimitriou","year":"1993","journal-title":"Math. Oper. Res."},{"key":"10.1006\/jagm.1998.0998_RF16","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/S0167-5060(08)70511-9","article-title":"Hamiltonian cycles and uniquely edge colourable graphs","volume":"3","author":"Thomason","year":"1978","journal-title":"Ann. Discrete Math"},{"key":"10.1006\/jagm.1998.0998_RF17","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1112\/jlms\/s1-21.2.98","article-title":"On Hamiltonian circuits","volume":"21","author":"Tutte","year":"1946","journal-title":"J. London Math. Soc."},{"key":"10.1006\/jagm.1998.0998_RF18","unstructured":"M. Yannakakis, 1996"}],"container-title":["Journal of Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677498909981?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0196677498909981?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T03:20:11Z","timestamp":1557285611000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0196677498909981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,4]]},"references-count":18,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,4]]}},"alternative-id":["S0196677498909981"],"URL":"https:\/\/doi.org\/10.1006\/jagm.1998.0998","relation":{},"ISSN":["0196-6774"],"issn-type":[{"value":"0196-6774","type":"print"}],"subject":[],"published":{"date-parts":[[1999,4]]}}}