{"id":"https://openalex.org/W7151653679","doi":"https://doi.org/10.7155/jgaa.v30i1.3028","title":"Improved Combinatorial Approximation Algorithms for Feedback Arc Set and Rank Aggregation Problems","display_name":"Improved Combinatorial Approximation Algorithms for Feedback Arc Set and Rank Aggregation Problems","publication_year":2026,"publication_date":"2026-04-07","ids":{"openalex":"https://openalex.org/W7151653679","doi":"https://doi.org/10.7155/jgaa.v30i1.3028"},"language":null,"primary_location":{"id":"doi:10.7155/jgaa.v30i1.3028","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i1.3028","pdf_url":"https://jgaa.info/index.php/jgaa/article/download/3028/3024","source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://jgaa.info/index.php/jgaa/article/download/3028/3024","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5004997794","display_name":"Mojtaba Ostovari","orcid":null},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Mojtaba Ostovari","raw_affiliation_strings":["Sharif University of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sharif University of Technology","institution_ids":["https://openalex.org/I133529467"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5133116094","display_name":"Alireza Zarei","orcid":null},"institutions":[{"id":"https://openalex.org/I133529467","display_name":"Sharif University of Technology","ror":"https://ror.org/024c2fq17","country_code":"IR","type":"education","lineage":["https://openalex.org/I133529467"]}],"countries":["IR"],"is_corresponding":false,"raw_author_name":"Alireza Zarei","raw_affiliation_strings":["Sharif University of Technology"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Sharif University of Technology","institution_ids":["https://openalex.org/I133529467"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.55656962,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"30","issue":"1","first_page":"133","last_page":"150"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.5537999868392944,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10991","display_name":"Game Theory and Voting Systems","score":0.5537999868392944,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2745000123977661,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.05119999870657921,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7042999863624573},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.611299991607666},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5763000249862671},{"id":"https://openalex.org/keywords/rank","display_name":"Rank (graph theory)","score":0.5424000024795532},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4738999903202057},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4729999899864197},{"id":"https://openalex.org/keywords/triangle-inequality","display_name":"Triangle inequality","score":0.3862000107765198},{"id":"https://openalex.org/keywords/arc","display_name":"Arc (geometry)","score":0.38440001010894775}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7042999863624573},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.611299991607666},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5763000249862671},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5644999742507935},{"id":"https://openalex.org/C164226766","wikidata":"https://www.wikidata.org/wiki/Q7293202","display_name":"Rank (graph theory)","level":2,"score":0.5424000024795532},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4738999903202057},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4729999899864197},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.44190001487731934},{"id":"https://openalex.org/C182964748","wikidata":"https://www.wikidata.org/wiki/Q208216","display_name":"Triangle inequality","level":2,"score":0.3862000107765198},{"id":"https://openalex.org/C83415579","wikidata":"https://www.wikidata.org/wiki/Q161973","display_name":"Arc (geometry)","level":2,"score":0.38440001010894775},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.3714999854564667},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34529998898506165},{"id":"https://openalex.org/C97542219","wikidata":"https://www.wikidata.org/wiki/Q497863","display_name":"SIMPLE algorithm","level":2,"score":0.3425000011920929},{"id":"https://openalex.org/C60033838","wikidata":"https://www.wikidata.org/wiki/Q1751685","display_name":"Solution set","level":3,"score":0.3402000069618225},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33469998836517334},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31790000200271606},{"id":"https://openalex.org/C90199385","wikidata":"https://www.wikidata.org/wiki/Q6692777","display_name":"Low-rank approximation","level":3,"score":0.3091999888420105},{"id":"https://openalex.org/C122818955","wikidata":"https://www.wikidata.org/wiki/Q1060343","display_name":"Independent set","level":3,"score":0.299699991941452},{"id":"https://openalex.org/C115908005","wikidata":"https://www.wikidata.org/wiki/Q2668364","display_name":"Combinatorial explosion","level":2,"score":0.2856999933719635},{"id":"https://openalex.org/C52692508","wikidata":"https://www.wikidata.org/wiki/Q1333872","display_name":"Combinatorial optimization","level":2,"score":0.28029999136924744},{"id":"https://openalex.org/C148043351","wikidata":"https://www.wikidata.org/wiki/Q4456944","display_name":"Current (fluid)","level":2,"score":0.2791999876499176},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.27889999747276306},{"id":"https://openalex.org/C39847760","wikidata":"https://www.wikidata.org/wiki/Q1385465","display_name":"Extreme point","level":2,"score":0.2718000113964081}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.7155/jgaa.v30i1.3028","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i1.3028","pdf_url":"https://jgaa.info/index.php/jgaa/article/download/3028/3024","source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.7155/jgaa.v30i1.3028","is_oa":true,"landing_page_url":"https://doi.org/10.7155/jgaa.v30i1.3028","pdf_url":"https://jgaa.info/index.php/jgaa/article/download/3028/3024","source":{"id":"https://openalex.org/S33451491","display_name":"Journal of Graph Algorithms and Applications","issn_l":"1526-1719","issn":["1526-1719"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Graph Algorithms and Applications","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7151653679.pdf","grobid_xml":"https://content.openalex.org/works/W7151653679.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"introduces":[2],"a":[3,19,115,120,217],"simple":[4,219],"and":[5,98,166,255],"fast":[6],"method":[7,248],"to":[8,132,179,241,249,263],"combinatorially":[9],"approximate":[10,250],"the":[11,34,41,52,58,63,77,84,96,99,124,184,195,235,247,251,257,260,264],"feedback":[12,36,79],"arc":[13,37,80],"set":[14,59],"problem":[15,39,82,254],"on":[16,48,91],"weighted":[17],"tournaments,":[18],"well-known":[20],"classical":[21],"NP-hard":[22],"problem.":[23],"Our":[24],"results":[25,215,261],"are":[26,143],"as":[27],"follows:":[28],"A":[29,72],"combinatorial":[30,73],"3-approximation":[31],"algorithm":[32,75,117,220],"for":[33,76],"\\textit{minimum":[35,78],"set}":[38,81],"with":[40,83,130,150,163],"expected":[42,85],"running":[43,86,125,196],"time":[44,87,126,197],"of":[45,60,62,88,159,174,187,228,259],"$O(|V|\\log":[46,89],"|V|)$":[47,90],"tournaments":[49,92],"that":[50,93,146,191,221,234],"satisfy":[51,94],"probability":[53,97],"constraints,":[54],"where":[55],"$V$":[56],"is":[57,127,190,206],"vertices":[61],"tournament.":[64],"The":[65,103],"previously":[66,104],"best-known":[67,105],"approximation":[68,106,122,152,202],"factor":[69,107],"was":[70,108],"4.":[71],"5/3-approximation":[74],"both":[95],"triangle":[100],"inequality":[101],"constraints.":[102],"2.":[109],"Although":[110],"these":[111,148,201,214],"problems":[112,149],"currently":[113],"have":[114,231],"PTAS":[116],"which":[118,169],"returns":[119],"$1+\\epsilon$":[121],"solution,":[123],"doubly":[128],"exponential":[129],"respect":[131],"$1/\\epsilon$,":[133],"being":[134],"merely":[135],"significant":[136],"in":[137,157,181,225],"theory":[138],"or":[139],"practice.":[140,182],"Moreover,":[141],"there":[142],"LP-based":[144],"algorithms":[145,189],"solve":[147,160],"better":[151],"factors":[153],"than":[154],"ours,":[155],"but,":[156],"expense":[158],"an":[161,171],"LP":[162],"$O(|V|^2)$":[164],"variables":[165],"$O(|V|^3)$":[167],"constraints":[168],"requires":[170],"excessive":[172],"expenditure":[173],"time,":[175],"making":[176],"them":[177],"inappropriate":[178],"use":[180,246],"Therefore,":[183],"main":[185],"superiority":[186,258],"our":[188],"they":[192],"dramatically":[193],"reduce":[194],"by":[198,216],"slightly":[199],"increasing":[200],"factors.Another":[203],"considerable":[204],"point":[205],"that,":[207],"despite":[208],"its":[209],"complex":[210],"analyses,":[211],"we":[212,245],"obtain":[213],"very":[218],"can":[222,238],"be":[223,239],"implemented":[224],"several":[226],"lines":[227],"code.":[229],"We":[230],"also":[232],"shown":[233],"proposed":[236],"approach":[237],"applied":[240],"other":[242],"problems.":[243],"Here,":[244],"rank":[252],"aggregation":[253],"show":[256],"compared":[262],"current":[265],"solutions.":[266]},"counts_by_year":[],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2026-04-08T00:00:00"}