{"id":"https://openalex.org/W1858540722","doi":"https://doi.org/10.1007/978-3-540-24767-8_18","title":"A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes","display_name":"A Robust and Fast Algorithm for Computing Exact and Approximate Shortest Visiting Routes","publication_year":2004,"publication_date":"2004-01-01","ids":{"openalex":"https://openalex.org/W1858540722","doi":"https://doi.org/10.1007/978-3-540-24767-8_18","mag":"1858540722"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-24767-8_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-24767-8_18","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/A5020926453","display_name":"H\u00e5kan J\u00f6nsson","orcid":"https://orcid.org/0000-0002-7621-8132"},"institutions":[{"id":"https://openalex.org/I190632392","display_name":"Lule\u00e5 University of Technology","ror":"https://ror.org/016st3p78","country_code":"SE","type":"education","lineage":["https://openalex.org/I190632392"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"H\u00e5kan Jonsson","raw_affiliation_strings":["Department of Computer Science and Electrical Engineering, Lule\u00e5 University of Technology, SE-971 87, Lule\u00e5, Sweden"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and Electrical Engineering, Lule\u00e5 University of Technology, SE-971 87, Lule\u00e5, Sweden","institution_ids":["https://openalex.org/I190632392"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020926453"],"corresponding_institution_ids":["https://openalex.org/I190632392"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.4173,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.60706402,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"168","last_page":"177"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9908000230789185,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.972599983215332,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/simple-polygon","display_name":"Simple polygon","score":0.6551701426506042},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6470114588737488},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5792714357376099},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5354601740837097},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5331702828407288},{"id":"https://openalex.org/keywords/polygon","display_name":"Polygon (computer graphics)","score":0.49255236983299255},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4852466583251953},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4779272675514221},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.44616714119911194},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41080567240715027},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3494119644165039},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10845041275024414},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.09175980091094971}],"concepts":[{"id":"https://openalex.org/C197949415","wikidata":"https://www.wikidata.org/wiki/Q782746","display_name":"Simple polygon","level":3,"score":0.6551701426506042},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6470114588737488},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5792714357376099},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5354601740837097},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5331702828407288},{"id":"https://openalex.org/C190694206","wikidata":"https://www.wikidata.org/wiki/Q3276654","display_name":"Polygon (computer graphics)","level":3,"score":0.49255236983299255},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4852466583251953},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4779272675514221},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.44616714119911194},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41080567240715027},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3494119644165039},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10845041275024414},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.09175980091094971},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C126042441","wikidata":"https://www.wikidata.org/wiki/Q1324888","display_name":"Frame (networking)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-540-24767-8_18","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-24767-8_18","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.106.477","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.106.477","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.sm.luth.se/csee/courses/smd/156/lectures/vertices.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W115685709","https://openalex.org/W307896644","https://openalex.org/W1557739567","https://openalex.org/W2004884735","https://openalex.org/W2028875546","https://openalex.org/W2032159439","https://openalex.org/W2038699153","https://openalex.org/W2046419297","https://openalex.org/W2052861240","https://openalex.org/W2055569927","https://openalex.org/W2059238087","https://openalex.org/W2064191526","https://openalex.org/W2086966885","https://openalex.org/W2088309380","https://openalex.org/W2106413026","https://openalex.org/W2132339863","https://openalex.org/W2139230981","https://openalex.org/W2979591006","https://openalex.org/W3163985862","https://openalex.org/W4252017042"],"related_works":["https://openalex.org/W2608536130","https://openalex.org/W2102467404","https://openalex.org/W2987051945","https://openalex.org/W53644101","https://openalex.org/W2154329468","https://openalex.org/W2389833224","https://openalex.org/W2154141401","https://openalex.org/W1571990143","https://openalex.org/W2372903818","https://openalex.org/W1567510565"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}