{"id":"https://openalex.org/W2789688218","doi":"https://doi.org/10.1587/transinf.2017fcl0003","title":"Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem","display_name":"Polynomial-Space Exact Algorithms for the Bipartite Traveling Salesman Problem","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2789688218","doi":"https://doi.org/10.1587/transinf.2017fcl0003","mag":"2789688218"},"language":"en","primary_location":{"id":"doi:10.1587/transinf.2017fcl0003","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2017fcl0003","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E101.D/3/E101.D_2017FCL0003/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.jstage.jst.go.jp/article/transinf/E101.D/3/E101.D_2017FCL0003/_pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020560631","display_name":"Mohd Shahrizan Othman","orcid":null},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Mohd SHAHRIZAN OTHMAN","raw_affiliation_strings":["Graduate School of Informatics, Department of Applied Mathematics and Physics, Kyoto University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Department of Applied Mathematics and Physics, Kyoto University","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084691948","display_name":"Aleksandar Shurbevski","orcid":"https://orcid.org/0000-0001-9224-6929"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Aleksandar SHURBEVSKI","raw_affiliation_strings":["Graduate School of Informatics, Department of Applied Mathematics and Physics, Kyoto University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Department of Applied Mathematics and Physics, Kyoto University","institution_ids":["https://openalex.org/I22299242"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073738140","display_name":"Hiroshi Nagamochi","orcid":"https://orcid.org/0000-0002-8332-1517"},"institutions":[{"id":"https://openalex.org/I22299242","display_name":"Kyoto University","ror":"https://ror.org/02kpeqv85","country_code":"JP","type":"education","lineage":["https://openalex.org/I22299242"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroshi NAGAMOCHI","raw_affiliation_strings":["Graduate School of Informatics, Department of Applied Mathematics and Physics, Kyoto University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Graduate School of Informatics, Department of Applied Mathematics and Physics, Kyoto University","institution_ids":["https://openalex.org/I22299242"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I22299242"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.02270449,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"E101.D","issue":"3","first_page":"611","last_page":"612"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.916100025177002,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T12401","display_name":"Scheduling and Timetabling Solutions","score":0.916100025177002,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.9195994138717651},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.88336181640625},{"id":"https://openalex.org/keywords/digraph","display_name":"Digraph","score":0.7601819038391113},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6490319967269897},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6191837191581726},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.591228723526001},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5890408158302307},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.5543255805969238},{"id":"https://openalex.org/keywords/bottleneck-traveling-salesman-problem","display_name":"Bottleneck traveling salesman problem","score":0.48834916949272156},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46566036343574524},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.4641808867454529},{"id":"https://openalex.org/keywords/hamiltonian-path-problem","display_name":"Hamiltonian path problem","score":0.46225282549858093},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.445832759141922},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.43975794315338135},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41627100110054016},{"id":"https://openalex.org/keywords/space","display_name":"Space (punctuation)","score":0.4115544855594635},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.22070324420928955},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.20566099882125854}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.9195994138717651},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.88336181640625},{"id":"https://openalex.org/C2779145032","wikidata":"https://www.wikidata.org/wiki/Q191494","display_name":"Digraph","level":2,"score":0.7601819038391113},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6490319967269897},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6191837191581726},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.591228723526001},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5890408158302307},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.5543255805969238},{"id":"https://openalex.org/C7668213","wikidata":"https://www.wikidata.org/wiki/Q4949085","display_name":"Bottleneck traveling salesman problem","level":3,"score":0.48834916949272156},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46566036343574524},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.4641808867454529},{"id":"https://openalex.org/C104737047","wikidata":"https://www.wikidata.org/wiki/Q987652","display_name":"Hamiltonian path problem","level":4,"score":0.46225282549858093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.445832759141922},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.43975794315338135},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41627100110054016},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.4115544855594635},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.22070324420928955},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.20566099882125854},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1587/transinf.2017fcl0003","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2017fcl0003","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E101.D/3/E101.D_2017FCL0003/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1587/transinf.2017fcl0003","is_oa":true,"landing_page_url":"https://doi.org/10.1587/transinf.2017fcl0003","pdf_url":"https://www.jstage.jst.go.jp/article/transinf/E101.D/3/E101.D_2017FCL0003/_pdf","source":{"id":"https://openalex.org/S2486202937","display_name":"IEICE Transactions on Information and Systems","issn_l":"0916-8532","issn":["0916-8532","1745-1361"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Information and Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.4099999964237213}],"awards":[{"id":"https://openalex.org/G146149645","display_name":"Design of Algorithms for Discrete Optimization Based on Graph-Theoretical Methods","funder_award_id":"17K00014","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2789688218.pdf","grobid_xml":"https://content.openalex.org/works/W2789688218.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W2012473793","https://openalex.org/W2155235203","https://openalex.org/W2164066496","https://openalex.org/W2477854488","https://openalex.org/W4388397210"],"related_works":["https://openalex.org/W4387272283","https://openalex.org/W1618127724","https://openalex.org/W4299647289","https://openalex.org/W2952856011","https://openalex.org/W2155631825","https://openalex.org/W2011032737","https://openalex.org/W2075524116","https://openalex.org/W2182383730","https://openalex.org/W586393309","https://openalex.org/W78044423"],"abstract_inverted_index":{"Given":[0],"an":[1,69],"edge-weighted":[2],"bipartite":[3,65],"digraph":[4],"G=(A,B;E),":[5],"the":[6,15,31,45,64,76],"Bipartite":[7],"Traveling":[8],"Salesman":[9],"Problem":[10],"(BTSP)":[11],"asks":[12],"to":[13],"find":[14],"minimum":[16],"cost":[17],"of":[18,22,48,54,73],"a":[19],"Hamiltonian":[20],"cycle":[21],"G,":[23],"or":[24],"determine":[25],"that":[26],"none":[27],"exists.":[28],"When":[29],"|A|=|B|=n,":[30],"BTSP":[32],"can":[33],"be":[34],"solved":[35],"using":[36,44],"polynomial":[37],"space":[38],"in":[39],"O*(42nnlog":[40],"n)":[41],"time":[42,71],"by":[43],"divide-and-conquer":[46],"algorithm":[47,62],"Gurevich":[49],"and":[50,67],"Shelah":[51],"(SIAM":[52],"Journal":[53],"Computation,":[55],"16(3),":[56],"pp.486-502,":[57],"1987).":[58],"We":[59],"adapt":[60],"their":[61],"for":[63],"case,":[66],"show":[68],"improved":[70],"bound":[72],"O*(42n),":[74],"saving":[75],"nlog":[77],"n":[78],"factor.":[79]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-08-10T07:06:39.071514","created_date":"2025-10-10T00:00:00"}