{"id":"https://openalex.org/W1929115470","doi":"https://doi.org/10.1007/978-3-642-45030-3_60","title":"Euclidean Traveling Salesman Tours through Stochastic Neighborhoods","display_name":"Euclidean Traveling Salesman Tours through Stochastic Neighborhoods","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W1929115470","doi":"https://doi.org/10.1007/978-3-642-45030-3_60","mag":"1929115470"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-45030-3_60","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-45030-3_60","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5046945057","display_name":"Pegah Kamousi","orcid":null},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Pegah Kamousi","raw_affiliation_strings":["Department of Computer Science, UC Santa Barbara, CA, 93106, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, UC Santa Barbara, CA, 93106, USA","institution_ids":["https://openalex.org/I154570441"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072397842","display_name":"Subhash Suri","orcid":"https://orcid.org/0000-0002-5668-7521"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Subhash Suri","raw_affiliation_strings":["Department of Computer Science, UC Santa Barbara, CA, 93106, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, UC Santa Barbara, CA, 93106, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5046945057"],"corresponding_institution_ids":["https://openalex.org/I154570441"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":1.337,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.81343874,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"644","last_page":"654"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9962000250816345,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8751380443572998},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6335003972053528},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5292590856552124},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.515203058719635},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.45230603218078613},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4282306134700775},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.42574864625930786},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.4164392352104187},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.41375356912612915},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3745254874229431},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.31939375400543213},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2940666675567627},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.26613688468933105}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8751380443572998},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6335003972053528},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5292590856552124},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.515203058719635},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.45230603218078613},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4282306134700775},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.42574864625930786},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.4164392352104187},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.41375356912612915},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3745254874229431},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.31939375400543213},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2940666675567627},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.26613688468933105},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-45030-3_60","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-45030-3_60","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6700000166893005,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1497266811","https://openalex.org/W1544478599","https://openalex.org/W1576498301","https://openalex.org/W1598073724","https://openalex.org/W1846028264","https://openalex.org/W1966612958","https://openalex.org/W1968165428","https://openalex.org/W1981673685","https://openalex.org/W1982280823","https://openalex.org/W1987387255","https://openalex.org/W2002285507","https://openalex.org/W2014068360","https://openalex.org/W2044027392","https://openalex.org/W2047747795","https://openalex.org/W2054575839","https://openalex.org/W2079896400","https://openalex.org/W2103209505","https://openalex.org/W2104577855","https://openalex.org/W2107989318","https://openalex.org/W2110824994","https://openalex.org/W2113076619","https://openalex.org/W2126135931","https://openalex.org/W2128005148","https://openalex.org/W2129557546","https://openalex.org/W2145889589","https://openalex.org/W2150217455","https://openalex.org/W2626123884","https://openalex.org/W3121675905","https://openalex.org/W4232237158","https://openalex.org/W4243947355","https://openalex.org/W4253378742"],"related_works":["https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2164188042","https://openalex.org/W2359992618","https://openalex.org/W2962917430","https://openalex.org/W2028468530","https://openalex.org/W4299801389","https://openalex.org/W2574604093","https://openalex.org/W2775068415","https://openalex.org/W1903284337"],"abstract_inverted_index":null,"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}