{"id":"https://openalex.org/W2739990116","doi":"https://doi.org/10.24963/ijcai.2017/616","title":"An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization","display_name":"An Improved Approximation Algorithm for the Subpath Planning Problem and Its Generalization","publication_year":2017,"publication_date":"2017-07-28","ids":{"openalex":"https://openalex.org/W2739990116","doi":"https://doi.org/10.24963/ijcai.2017/616","mag":"2739990116"},"language":"en","primary_location":{"id":"doi:10.24963/ijcai.2017/616","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/616","pdf_url":"https://www.ijcai.org/proceedings/2017/0616.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://www.ijcai.org/proceedings/2017/0616.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5040863107","display_name":"Hanna Sumita","orcid":"https://orcid.org/0000-0003-4005-3206"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hanna Sumita","raw_affiliation_strings":["National Institute of Informatics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics","institution_ids":["https://openalex.org/I184597095"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068948211","display_name":"Yuma Yonebayashi","orcid":null},"institutions":[{"id":"https://openalex.org/I74801974","display_name":"The University of Tokyo","ror":"https://ror.org/057zh3y96","country_code":"JP","type":"education","lineage":["https://openalex.org/I74801974"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yuma Yonebayashi","raw_affiliation_strings":["University of Tokyo"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Tokyo","institution_ids":["https://openalex.org/I74801974"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047111221","display_name":"Naonori Kakimura","orcid":"https://orcid.org/0000-0002-3918-3479"},"institutions":[{"id":"https://openalex.org/I203951103","display_name":"Keio University","ror":"https://ror.org/02kn6nx58","country_code":"JP","type":"education","lineage":["https://openalex.org/I203951103"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Naonori Kakimura","raw_affiliation_strings":["Keio University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Keio University","institution_ids":["https://openalex.org/I203951103"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008961593","display_name":"Ken\u2010ichi Kawarabayashi","orcid":"https://orcid.org/0000-0001-6056-4287"},"institutions":[{"id":"https://openalex.org/I184597095","display_name":"National Institute of Informatics","ror":"https://ror.org/04ksd4g47","country_code":"JP","type":"facility","lineage":["https://openalex.org/I1319490839","https://openalex.org/I184597095","https://openalex.org/I4210158934"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Ken-ichi Kawarabayashi","raw_affiliation_strings":["National Institute of Informatics"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"National Institute of Informatics","institution_ids":["https://openalex.org/I184597095"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9228,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.79640416,"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":"4412","last_page":"4418"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9997000098228455,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9948999881744385,"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.729438066482544},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6542439460754395},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6508232355117798},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5796327590942383},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5451294183731079},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.49166542291641235},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4399562478065491},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4378737509250641},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3443721532821655}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.729438066482544},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6542439460754395},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6508232355117798},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5796327590942383},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5451294183731079},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.49166542291641235},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4399562478065491},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4378737509250641},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3443721532821655},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.24963/ijcai.2017/616","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/616","pdf_url":"https://www.ijcai.org/proceedings/2017/0616.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.24963/ijcai.2017/616","is_oa":true,"landing_page_url":"https://doi.org/10.24963/ijcai.2017/616","pdf_url":"https://www.ijcai.org/proceedings/2017/0616.pdf","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","raw_type":"proceedings-article"},"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.5299999713897705}],"awards":[{"id":"https://openalex.org/G648459597","display_name":null,"funder_award_id":"JPMJER1201","funder_id":"https://openalex.org/F4320338112","funder_display_name":"Exploratory Research for Advanced Technology"}],"funders":[{"id":"https://openalex.org/F4320338112","display_name":"Exploratory Research for Advanced Technology","ror":null}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2739990116.pdf","grobid_xml":"https://content.openalex.org/works/W2739990116.grobid-xml"},"referenced_works_count":33,"referenced_works":["https://openalex.org/W93737390","https://openalex.org/W586812926","https://openalex.org/W1557310162","https://openalex.org/W1579357606","https://openalex.org/W1969186119","https://openalex.org/W1971483538","https://openalex.org/W1982687611","https://openalex.org/W1994248285","https://openalex.org/W2001541414","https://openalex.org/W2042986967","https://openalex.org/W2043916130","https://openalex.org/W2051579561","https://openalex.org/W2054420170","https://openalex.org/W2062403584","https://openalex.org/W2086917808","https://openalex.org/W2103776982","https://openalex.org/W2117226423","https://openalex.org/W2125145773","https://openalex.org/W2126141749","https://openalex.org/W2136400551","https://openalex.org/W2155170445","https://openalex.org/W2161754147","https://openalex.org/W2162750432","https://openalex.org/W2164673645","https://openalex.org/W2165142526","https://openalex.org/W2167920923","https://openalex.org/W2240189712","https://openalex.org/W2278286793","https://openalex.org/W2553523329","https://openalex.org/W2566990295","https://openalex.org/W2578864413","https://openalex.org/W2765549233","https://openalex.org/W4210431029"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W1525389557","https://openalex.org/W2361554335","https://openalex.org/W2164188042","https://openalex.org/W2359992618","https://openalex.org/W4306878646","https://openalex.org/W2054495636","https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W1553466895"],"abstract_inverted_index":{"This":[0],"paper":[1],"focuses":[2],"on":[3,25],"a":[4,26,33,60,88,104,116,132],"generalization":[5,89],"of":[6,44,79,90,106,109],"the":[7,13,39,45,69,93,122,149],"traveling":[8],"salesman":[9],"problem":[10,16,96],"(TSP),":[11],"called":[12,92],"subpath":[14],"planning":[15,95],"(SPP).":[17],"Given":[18],"2n":[19],"vertices":[20,123],"and":[21,52,111],"n":[22],"independent":[23],"edges":[24],"metric":[27],"space,":[28],"we":[29,86,101,112],"aim":[30,113],"to":[31,58,114],"find":[32,115],"shortest":[34,117],"tour":[35,118],"that":[36,63,120],"contains":[37],"all":[38,121],"edges.":[40],"SPP":[41,91],"is":[42,57,76],"one":[43],"fundamental":[46],"problems":[47],"in":[48,65,124],"both":[49],"artificial":[50],"intelligence":[51],"robotics.":[53],"Our":[54],"main":[55],"result":[56],"design":[59],"1.5-approximation":[61],"algorithm":[62,134],"runs":[64],"polynomial":[66],"time,":[67],"improving":[68],"currently":[70],"best":[71],"approximation":[72],"algorithm.":[73],"The":[74],"idea":[75],"direct":[77],"use":[78],"techniques":[80],"developed":[81],"for":[82,135,156],"TSP.":[83],"In":[84,98],"addition,":[85],"propose":[87,131],"subgroup":[94],"(SGPP).":[97],"this":[99],"problem,":[100],"are":[102,127],"given":[103],"set":[105],"disjoint":[107],"groups":[108],"vertices,":[110],"such":[119],"each":[125],"group":[126],"traversed":[128],"sequentially.":[129],"We":[130,137],"3-approximation":[133],"SGPP.":[136],"also":[138],"conduct":[139],"numerical":[140],"experiments.":[141],"Compared":[142],"with":[143,159],"previous":[144],"algorithms,":[145],"our":[146],"algorithms":[147],"improve":[148],"solution":[150],"quality":[151],"by":[152],"more":[153,160],"than":[154,161],"10%":[155],"large":[157],"instances":[158],"10,000":[162],"vertices.":[163]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}