{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T06:14:57Z","timestamp":1729664097484,"version":"3.28.0"},"reference-count":12,"publisher":"IEEE Comput. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2002.1182004","type":"proceedings-article","created":{"date-parts":[[2003,6,26]],"date-time":"2003-06-26T11:35:00Z","timestamp":1056627300000},"page":"789-798","source":"Crossref","is-referenced-by-count":0,"title":["On random symmetric travelling salesman problems"],"prefix":"10.1109","author":[{"given":"A.","family":"Frieze","sequence":"first","affiliation":[]}],"member":"263","reference":[{"key":"3","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1002\/1098-2418(200007)16:4<369::AID-RSA6>3.0.CO;2-J","article-title":"Hamilton cycles in random graphs and digraphs","volume":"16","author":"cooper","year":"2000","journal-title":"Random Structures and Algorithms"},{"key":"2","article-title":"Branch and bound methods","author":"balas","year":"1985","journal-title":"The Traveling Salesman Problem A Guided Tour of Combinatorial Optimization"},{"key":"10","article-title":"Probabilistic analysis of heuristics","author":"karp","year":"1985","journal-title":"The Traveling Salesman Problem A Guided Tour of Combinatorial Optimization"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.1015"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90059-9"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(85)90058-7"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579431"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585751"},{"key":"9","doi-asserted-by":"crossref","first-page":"561","DOI":"10.1137\/0208045","article-title":"A patching algorithm for the non-symmetric traveling salesman problem","volume":"8","author":"karp","year":"1979","journal-title":"SIAM Journal on Computing"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701391518"},{"article-title":"Matching theory","year":"1986","author":"lova?sz","key":"11"},{"key":"12","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1137\/0208036","article-title":"On the expected value of a random asignment problem","volume":"8","author":"walkup","year":"1979","journal-title":"-em SIAM Journal on Computing"}],"event":{"name":"43rd Annual IEEE Symposium on Foundations of Computer Science","acronym":"SFCS-02","location":"Vancouver, BC, Canada"},"container-title":["The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8411\/26517\/01182004.pdf?arnumber=1182004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,15]],"date-time":"2017-06-15T18:46:26Z","timestamp":1497552386000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1182004\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":12,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2002.1182004","relation":{},"subject":[]}}