{"id":"https://openalex.org/W2078186061","doi":"https://doi.org/10.1145/2525314.2525342","title":"Parameterized algorithms for generalized traveling salesman problems in road networks","display_name":"Parameterized algorithms for generalized traveling salesman problems in road networks","publication_year":2013,"publication_date":"2013-11-05","ids":{"openalex":"https://openalex.org/W2078186061","doi":"https://doi.org/10.1145/2525314.2525342","mag":"2078186061"},"language":"en","primary_location":{"id":"doi:10.1145/2525314.2525342","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2525314.2525342","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"},"type":"conference-paper","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/A5028161236","display_name":"Michael N. Rice","orcid":null},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael N. Rice","raw_affiliation_strings":["University of California, Riverside (UCR), Riverside, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Riverside (UCR), Riverside, CA","institution_ids":["https://openalex.org/I103635307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5000947547","display_name":"Vassilis J. Tsotras","orcid":"https://orcid.org/0000-0001-5462-9451"},"institutions":[{"id":"https://openalex.org/I103635307","display_name":"University of California, Riverside","ror":"https://ror.org/03nawhv43","country_code":"US","type":"education","lineage":["https://openalex.org/I103635307"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vassilis J. Tsotras","raw_affiliation_strings":["University of California, Riverside (UCR), Riverside, CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of California, Riverside (UCR), Riverside, CA","institution_ids":["https://openalex.org/I103635307"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I103635307"],"apc_list":null,"apc_paid":null,"fwci":2.1134,"has_fulltext":false,"cited_by_count":22,"citation_normalized_percentile":{"value":0.89411765,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"114","last_page":"123"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"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"}},"topics":[{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9994999766349792,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991999864578247,"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"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9932000041007996,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"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/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8831521272659302},{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.767119288444519},{"id":"https://openalex.org/keywords/traveling-purchaser-problem","display_name":"Traveling purchaser problem","score":0.606083869934082},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.586921751499176},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5858466625213623},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.560371994972229},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4952923357486725},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4896562695503235},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4813557267189026},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4294644296169281},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.42920345067977905},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.40443533658981323}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8831521272659302},{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.767119288444519},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.606083869934082},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.586921751499176},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5858466625213623},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.560371994972229},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4952923357486725},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4896562695503235},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4813557267189026},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4294644296169281},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.42920345067977905},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.40443533658981323},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2525314.2525342","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2525314.2525342","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5657968111","display_name":null,"funder_award_id":"IIS-1161997","funder_id":"https://openalex.org/F4320337389","funder_display_name":"Division of Information and Intelligent Systems"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320337389","display_name":"Division of Information and Intelligent Systems","ror":"https://ror.org/053a2cp42"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W36639738","https://openalex.org/W108694910","https://openalex.org/W180214381","https://openalex.org/W181167209","https://openalex.org/W1550030874","https://openalex.org/W1597203970","https://openalex.org/W1829285201","https://openalex.org/W1830048115","https://openalex.org/W1968165428","https://openalex.org/W1969483458","https://openalex.org/W1975856156","https://openalex.org/W1992370839","https://openalex.org/W2001625171","https://openalex.org/W2008656089","https://openalex.org/W2018269848","https://openalex.org/W2067061580","https://openalex.org/W2083974195","https://openalex.org/W2086987885","https://openalex.org/W2110824994","https://openalex.org/W2120988215","https://openalex.org/W2148831787","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W2308371765","https://openalex.org/W810420948","https://openalex.org/W4312198704","https://openalex.org/W2184672982","https://openalex.org/W2141056356","https://openalex.org/W2356976268","https://openalex.org/W2019808372","https://openalex.org/W2005119019","https://openalex.org/W71502349","https://openalex.org/W2078186061"],"abstract_inverted_index":{"The":[0],"Generalized":[1],"Traveling":[2],"Salesman":[3],"(Path)":[4],"Problem":[5],"involves":[6],"finding":[7],"a":[8,20],"minimum-cost":[9],"tour":[10],"(or":[11],"path)":[12],"through":[13],"exactly":[14],"one":[15],"location":[16,24,78],"from":[17],"each":[18],"of":[19,22,58,67,77,103,126],"set":[21],"generalized":[23],"categories":[25,123],"(e.g.,":[26],"gas":[27],"stations,":[28],"coffee":[29],"shops).":[30],"This":[31],"problem":[32,48,69],"type":[33],"has":[34],"many":[35],"practical":[36],"applications":[37],"in":[38,45,84,130,146],"personal":[39],"navigation":[40],"and":[41,90,124],"logistics.":[42],"While":[43],"NP-hard":[44],"general,":[46],"this":[47,95,137],"also":[49],"admits":[50],"fixed-parameter":[51],"tractable":[52],"(FPT)":[53],"algorithms":[54,93],"with":[55,72,119,151],"run":[56],"times":[57],"the":[59,68,75,100],"form":[60],"f(k)nO(1)":[61],"for":[62,94],"some":[63],"function":[64],"f":[65],"(independent":[66],"size,":[70],"n)":[71],"respect":[73,152],"to":[74,121,141,153],"number":[76],"categories,":[79],"k":[80],"(typically":[81],"very":[82],"small":[83],"practice).":[85],"We":[86],"present":[87],"both":[88],"exact":[89],"approximate":[91,134],"FPT":[92],"problem.":[96],"Experimental":[97],"results":[98],"on":[99,155],"road":[101],"network":[102],"North":[104],"America":[105],"(with":[106],"over":[107],"50":[108],"million":[109],"edges)":[110],"show":[111],"that":[112],"we":[113],"can":[114],"optimally":[115],"solve":[116],"nationwide":[117],"queries":[118],"up":[120],"7":[122],"millions":[125],"optional":[127],"category":[128],"locations":[129],"sub-second":[131],"time.":[132],"Our":[133],"solutions":[135],"improve":[136],"even":[138],"further":[139],"down":[140],"millisecond":[142],"query":[143],"times,":[144],"resulting":[145],"only":[147],"negligible":[148],"relative":[149],"error":[150],"optimality,":[154],"average.":[156]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":5},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}