{"id":"https://openalex.org/W2130200244","doi":"https://doi.org/10.1109/sfcs.2003.1238181","title":"Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs","display_name":"Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs","publication_year":2004,"publication_date":"2004-03-02","ids":{"openalex":"https://openalex.org/W2130200244","doi":"https://doi.org/10.1109/sfcs.2003.1238181","mag":"2130200244"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2003.1238181","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-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/A5006699796","display_name":"Haim Kaplan","orcid":"https://orcid.org/0000-0001-9586-8002"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"H. Kaplan","raw_affiliation_strings":["Tel-Aviv University, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5012404981","display_name":"Moshe Lewenstein","orcid":"https://orcid.org/0000-0002-8272-244X"},"institutions":[{"id":"https://openalex.org/I13955877","display_name":"Bar-Ilan University","ror":"https://ror.org/03kgsv495","country_code":"IL","type":"education","lineage":["https://openalex.org/I13955877"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"M. Lewenstein","raw_affiliation_strings":["Bar-Ilan University, Israel","Bar Ilan University ,"],"affiliations":[{"raw_affiliation_string":"Bar-Ilan University, Israel","institution_ids":["https://openalex.org/I13955877"]},{"raw_affiliation_string":"Bar Ilan University ,","institution_ids":["https://openalex.org/I13955877"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067943969","display_name":"Nira Shafrir","orcid":null},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"N. Shafrir","raw_affiliation_strings":["Tel-Aviv University, Israel","Tel-Aviv  University"],"affiliations":[{"raw_affiliation_string":"Tel-Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel-Aviv  University","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113309599","display_name":"M.N. Sviridenko","orcid":null},"institutions":[{"id":"https://openalex.org/I1341412227","display_name":"IBM (United States)","ror":"https://ror.org/05hh8d621","country_code":"US","type":"company","lineage":["https://openalex.org/I1341412227"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Sviridenko","raw_affiliation_strings":["IBM T.J. Watson Research Center, USA","IBM T.J. Watson research Center"],"affiliations":[{"raw_affiliation_string":"IBM T.J. Watson Research Center, USA","institution_ids":[]},{"raw_affiliation_string":"IBM T.J. Watson research Center","institution_ids":["https://openalex.org/I1341412227"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5006699796"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":8.9809,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.98308645,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"56","last_page":"65"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9887999892234802,"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.9887999892234802,"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.9861999750137329,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9815999865531921,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/multigraph","display_name":"Multigraph","score":0.9123754501342773},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7398791313171387},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.711471438407898},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5284490585327148},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.47133564949035645},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45328405499458313},{"id":"https://openalex.org/keywords/cycle-basis","display_name":"Cycle basis","score":0.4526479244232178},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.44842368364334106},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.16667425632476807}],"concepts":[{"id":"https://openalex.org/C17758045","wikidata":"https://www.wikidata.org/wiki/Q2642629","display_name":"Multigraph","level":3,"score":0.9123754501342773},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7398791313171387},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.711471438407898},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5284490585327148},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.47133564949035645},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45328405499458313},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.4526479244232178},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.44842368364334106},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.16667425632476807},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.0},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/sfcs.2003.1238181","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2003.1238181","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.296.1586","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.296.1586","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www2.warwick.ac.uk/fac/sci/dcs/people/maxim_sviridenko/journal6.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.78.8998","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.78.8998","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tau.ac.il/~haimk/papers/journal6.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":28,"referenced_works":["https://openalex.org/W1482447760","https://openalex.org/W1488861257","https://openalex.org/W1490932874","https://openalex.org/W1521148214","https://openalex.org/W1553729051","https://openalex.org/W1915280757","https://openalex.org/W1989048084","https://openalex.org/W2008217702","https://openalex.org/W2009803313","https://openalex.org/W2017314050","https://openalex.org/W2021625223","https://openalex.org/W2033530135","https://openalex.org/W2035610952","https://openalex.org/W2037050365","https://openalex.org/W2056179869","https://openalex.org/W2058748455","https://openalex.org/W2061753037","https://openalex.org/W2080721852","https://openalex.org/W2085110997","https://openalex.org/W2090223576","https://openalex.org/W2102403605","https://openalex.org/W2102706148","https://openalex.org/W2117226423","https://openalex.org/W2134761228","https://openalex.org/W2141355868","https://openalex.org/W2152453230","https://openalex.org/W2914372558","https://openalex.org/W6677426919"],"related_works":["https://openalex.org/W341486533","https://openalex.org/W1549308032","https://openalex.org/W2339534957","https://openalex.org/W2151370292","https://openalex.org/W634408543","https://openalex.org/W2081716679","https://openalex.org/W2939341016","https://openalex.org/W4283707785","https://openalex.org/W2167197687","https://openalex.org/W2137952152"],"abstract_inverted_index":{"A":[0],"directed":[1],"multigraph":[2,27,50],"is":[3,16,91,116,168,193,230],"said":[4],"to":[5,98,131,215],"be":[6],"d-regular":[7,49],"if":[8,47],"the":[9,48,119,153,173,176,200,216,226,235,241],"indegree":[10],"and":[11,93,155,255],"outdegree":[12],"of":[13,31,60,74,86,111,122,148,152,172,175,240],"every":[14],"vertex":[15],"exactly":[17],"d.":[18],"By":[19],"Hall's":[20],"theorem":[21,139],"one":[22,84,107],"can":[23,65],"represent":[24],"such":[25,100,108,135],"a":[26,29,67,95,109,128,133,145,164,180,189,203,210,222],"as":[28],"combination":[30],"at":[32,82,117,169,194],"most":[33,83,195],"n/sup":[34],"2/":[35,197,206],"cycle":[36,75,112],"covers":[37,76,113],"each":[38,78,87],"taken":[39],"with":[40,259],"an":[41,149],"appropriate":[42],"multiplicity.":[43],"We":[44],"prove":[45],"that":[46],"does":[51],"not":[52],"contain":[53],"more":[54],"than":[55,234],"/spl":[56],"lfloor/d/2/spl":[57],"rfloor/":[58],"copies":[59],"any":[61],"2-cycle":[62,79],"then":[63,140],"we":[64,125,162,187,220],"find":[66,99],"similar":[68],"decomposition":[69],"into":[70],"0(n/sup":[71],"2/)":[72],"pairs":[73],"where":[77],"occurs":[80],"in":[81,143],"component":[85],"pair.":[88,136],"Our":[89],"proof":[90],"constructive":[92],"gives":[94],"polynomial":[96],"algorithm":[97,130,224],"decomposition.":[101],"Since":[102],"our":[103],"applications":[104,239],"only":[105],"need":[106],"pair":[110],"whose":[114,166,191],"weight":[115,121,167,174,192],"least":[118,170],"average":[120],"all":[123],"pairs,":[124],"also":[126],"give":[127],"simpler":[129,233],"extract":[132],"single":[134],"This":[137],"combinatorial":[138],"comes":[141],"handy":[142],"rounding":[144,242],"fractional":[146],"solution":[147],"LP":[150],"relaxation":[151],"maximum":[154,160,213,248,256],"minimum":[156,185],"TSP":[157,186,214,258],"problems.":[158],"For":[159,184],"TSP,":[161],"obtain":[163,188,221],"tour":[165,190],"2/3":[171],"longest":[177],"tour,":[178],"improving":[179,202],"previous":[181,204,236],"5/8":[182],"approximation.":[183,208],"0.842log/sub":[196],"n":[198,207],"times":[199],"optimal,":[201],"0.999log/sub":[205],"Utilizing":[209],"reduction":[211],"from":[212],"shortest":[217],"superstring":[218],"problem":[219,228],"2.5-approximation":[223],"for":[225,247],"latter":[227],"which":[229],"again":[231],"much":[232],"one.":[237],"Other":[238],"procedure":[243],"are":[244],"approximation":[245],"algorithms":[246],"3-cycle":[249],"cover":[250],"(factor":[251,262],"2/3,":[252],"previously":[253,264],"3/5)":[254],"asymmetric":[257],"triangle":[260],"inequality":[261],"10/13,":[263],"3/4":[265],").":[266]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}