{"id":"https://openalex.org/W2048952924","doi":"https://doi.org/10.1137/110843514","title":"Finding 2-Factors Closer to TSP Tours in Cubic Graphs","display_name":"Finding 2-Factors Closer to TSP Tours in Cubic Graphs","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2048952924","doi":"https://doi.org/10.1137/110843514","mag":"2048952924"},"language":"en","primary_location":{"id":"doi:10.1137/110843514","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110843514","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","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/A5025268829","display_name":"Sylvia Boyd","orcid":"https://orcid.org/0000-0001-7884-0219"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sylvia Boyd","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040460257","display_name":"Satoru Iwata","orcid":"https://orcid.org/0000-0002-6467-1335"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Satoru Iwata","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5068632845","display_name":"Kenjiro Takazawa","orcid":"https://orcid.org/0000-0002-7662-7374"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kenjiro Takazawa","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025268829"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.6254,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.92982224,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"27","issue":"2","first_page":"918","last_page":"939"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9997000098228455,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9970999956130981,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9969000220298767,"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/combinatorics","display_name":"Combinatorics","score":0.7738702297210693},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7057689428329468},{"id":"https://openalex.org/keywords/cubic-graph","display_name":"Cubic graph","score":0.6444751024246216},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.5216734409332275},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38855981826782227},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3297843337059021},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.13822701573371887},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10329264402389526}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7738702297210693},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7057689428329468},{"id":"https://openalex.org/C100500283","wikidata":"https://www.wikidata.org/wiki/Q1374495","display_name":"Cubic graph","level":5,"score":0.6444751024246216},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.5216734409332275},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38855981826782227},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3297843337059021},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.13822701573371887},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10329264402389526},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/110843514","is_oa":false,"landing_page_url":"https://doi.org/10.1137/110843514","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1495913768","https://openalex.org/W1968919074","https://openalex.org/W1982316266","https://openalex.org/W1993298089","https://openalex.org/W1996169001","https://openalex.org/W1996575062","https://openalex.org/W2002065932","https://openalex.org/W2012855576","https://openalex.org/W2024011816","https://openalex.org/W2031140568","https://openalex.org/W2137498124","https://openalex.org/W2141355868","https://openalex.org/W2335389215","https://openalex.org/W2914940273","https://openalex.org/W4231553787","https://openalex.org/W4244591792","https://openalex.org/W4247278211"],"related_works":["https://openalex.org/W1978042415","https://openalex.org/W4299896325","https://openalex.org/W2778915083","https://openalex.org/W2032821182","https://openalex.org/W1855875669","https://openalex.org/W2077528687","https://openalex.org/W2000144448","https://openalex.org/W2056606203","https://openalex.org/W2081567714","https://openalex.org/W2071261821"],"abstract_inverted_index":{"In":[0],"this":[1,187],"paper":[2],"we":[3,130],"are":[4],"interested":[5],"in":[6,16,60,83,103,112,142,172],"algorithms":[7,110],"for":[8,50,92,135],"finding":[9,51,93,136,159],"$2$-factors":[10],"that":[11,74],"cover":[12],"certain":[13],"prescribed":[14],"edge-cuts":[15,36],"bridgeless":[17,62,104],"cubic":[18,63,105,144],"graphs.":[19,106],"Since":[20],"a":[21,25,43,52,67,94,132,137,160],"Hamilton":[22,44],"cycle":[23],"is":[24,118,169],"2-factor":[26,95,161],"covering":[27,34,55,96,162],"all":[28,56,79,97,163],"edge-cuts,":[29],"imposing":[30],"the":[31,38,57,80,98,119,127,149,170,196,199,205],"constraint":[32],"of":[33,70,75,108,121,126,153,174,198],"those":[35],"makes":[37],"obtained":[39],"$2$-factor":[40,54,201],"closer":[41],"to":[42,190],"cycle.":[45],"We":[46,87,184],"present":[47],"an":[48,90,124],"algorithm":[49,91,134,156],"minimum-weight":[53],"$3$-edge":[58],"cuts":[59,82,102],"weighted":[61],"graphs,":[64,145],"together":[65],"with":[66,158],"polyhedral":[68],"description":[69],"such":[71],"2-factors":[72],"and":[73,100,165,176,202],"perfect":[76],"matchings":[77],"intersecting":[78],"3-edge":[81],"exactly":[84],"one":[85],"edge.":[86],"further":[88],"give":[89],"$3$-":[99],"$4$-edge":[101],"Both":[107],"these":[109],"run":[111],"${\\rm":[113,182,191],"O}(n\\sp{3})$":[114],"time,":[115],"where":[116],"$n$":[117],"number":[120],"vertices.":[122],"As":[123],"application":[125],"latter":[128],"algorithm,":[129],"design":[131],"6/5-approximation":[133],"minimum":[138],"2-edge-connected":[139],"spanning":[140],"subgraph":[141],"3-edge-connected":[143],"which":[146,168],"improves":[147],"upon":[148],"previous":[150],"best":[151],"ratio":[152],"5/4.":[154],"The":[155],"begins":[157],"3-":[164],"4-edge":[166],"cuts,":[167],"bottleneck":[171],"terms":[173],"complexity,":[175],"thus":[177],"it":[178],"has":[179],"running":[180],"time":[181,188],"O}(n\\sp{3})$.":[183],"then":[185],"improve":[186],"complexity":[189],"O}(n\\sp{2}":[192],"\\log\\sp{4}n)$":[193],"by":[194],"relaxing":[195],"condition":[197],"initial":[200],"elaborating":[203],"on":[204],"subsequent":[206],"processes.":[207]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":9},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}