{"id":"https://openalex.org/W4390585045","doi":"https://doi.org/10.1137/22m1534134","title":"Packing and Covering a Given Directed Graph in a Directed Graph","display_name":"Packing and Covering a Given Directed Graph in a Directed Graph","publication_year":2024,"publication_date":"2024-01-04","ids":{"openalex":"https://openalex.org/W4390585045","doi":"https://doi.org/10.1137/22m1534134"},"language":"en","primary_location":{"id":"doi:10.1137/22m1534134","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/22m1534134","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/A5026016357","display_name":"Raphael Yuster","orcid":"https://orcid.org/0000-0001-7550-6506"},"institutions":[{"id":"https://openalex.org/I91203450","display_name":"University of Haifa","ror":"https://ror.org/02f009v59","country_code":"IL","type":"education","lineage":["https://openalex.org/I91203450"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Raphael Yuster","raw_affiliation_strings":["Department of Mathematics, University of Haifa, Haifa 3498838, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Haifa, Haifa 3498838, Israel","institution_ids":["https://openalex.org/I91203450"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5026016357"],"corresponding_institution_ids":["https://openalex.org/I91203450"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.00779299,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"38","issue":"1","first_page":"43","last_page":"54"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9993000030517578,"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.9993000030517578,"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.9961000084877014,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9955999851226807,"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/feedback-arc-set","display_name":"Feedback arc set","score":0.8486961722373962},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8193307518959045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8113336563110352},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.6529293656349182},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.56989985704422},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5643976926803589},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.48187384009361267},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48004472255706787},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4519680142402649},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.442362904548645},{"id":"https://openalex.org/keywords/tournament","display_name":"Tournament","score":0.4376221001148224},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.413852334022522},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.3227008581161499},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.24998867511749268},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.08483609557151794}],"concepts":[{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.8486961722373962},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8193307518959045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8113336563110352},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.6529293656349182},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.56989985704422},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5643976926803589},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.48187384009361267},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48004472255706787},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4519680142402649},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.442362904548645},{"id":"https://openalex.org/C136975688","wikidata":"https://www.wikidata.org/wiki/Q1320634","display_name":"Tournament","level":2,"score":0.4376221001148224},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.413852334022522},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.3227008581161499},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.24998867511749268},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.08483609557151794},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/22m1534134","is_oa":false,"landing_page_url":"http://dx.doi.org/10.1137/22m1534134","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":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1556797074","https://openalex.org/W1965059628","https://openalex.org/W1969037852","https://openalex.org/W1990901538","https://openalex.org/W1990953773","https://openalex.org/W2005943912","https://openalex.org/W2007508589","https://openalex.org/W2020243626","https://openalex.org/W2044422580","https://openalex.org/W2058108962","https://openalex.org/W2087159183","https://openalex.org/W2951773826","https://openalex.org/W3015452991","https://openalex.org/W3030488835","https://openalex.org/W3100918874","https://openalex.org/W3212107567"],"related_works":["https://openalex.org/W2604879517","https://openalex.org/W2363112923","https://openalex.org/W4386974102","https://openalex.org/W1980481456","https://openalex.org/W1511577792","https://openalex.org/W1997206487","https://openalex.org/W79682516","https://openalex.org/W3110485412","https://openalex.org/W2085331515","https://openalex.org/W2051163637"],"abstract_inverted_index":{".For":[0],"every":[1,143,218],"fixed":[2],"\\(k":[3],"\\ge":[4],"4\\),":[5],"it":[6,83,155,209,222],"is":[7,55,76,156,202],"proved":[8,57,157],"that":[9,34,40,58,97,158,182,187,204,211,216,224],"if":[10,159],"an":[11,160],"\\(n\\)-vertex":[12,161],"directed":[13,21,37,117,144,162],"graph":[14,145,150,163],"has":[15,164],"at":[16,29,51,165,177,198],"most":[17,30,52,166,178,199],"\\(t\\)":[18,167],"pairwise":[19,168],"arc-disjoint":[20,169],"\\(k\\)-cycles,":[22],"then":[23,171],"there":[24,172],"exists":[25,173],"a":[26,46,66,109,123,149,174,193],"set":[27,42,175,189],"of":[28,43,49,127,176,190,196],"\\(\\frac{2}{3}kt+":[31],"o(n^2)\\)":[32,180],"arcs":[33,181],"meets":[35,183],"all":[36,184,207],"\\(k\\)-cycles":[38,44],"and":[39,80,130,186,215],"the":[41,59,73,98,116,188],"admits":[45,192],"fractional":[47,194],"cover":[48,119,195],"value":[50,197],"\\(\\frac{2}{3}kt\\).":[53],"It":[54,201],"also":[56],"ratio":[60],"\\(\\frac{2}{3}k\\)":[61],"cannot":[62],"be":[63,101,104],"improved":[64,77],"to":[65,78,103],"constant":[67,74,99],"smaller":[68],"than":[69],"\\(\\frac{k}{2}\\).":[70],"For":[71],"\\(k=5\\)":[72],"\\(2k/3\\)":[75],"\\(25/8\\)":[79],"for":[81,115,142,153,205,217],"\\(k=3\\)":[82],"was":[84],"recently":[85],"shown":[86,203],"by":[87],"Cooper":[88],"et":[89],"al.":[90],"[European":[91],"J.":[92,133],"Combin.,":[93],"101":[94],"(2022),":[95],"103462]":[96],"can":[100],"taken":[102],"\\(9/5\\).":[105],"The":[106],"result":[107],"implies":[108],"deterministic":[110],"polynomial":[111],"time":[112],"\\(\\frac{2}{3}k\\)-approximation":[113],"algorithm":[114,126],"\\(k\\)-cycle":[118],"problem,":[120],"improving":[121],"upon":[122],"previous":[124],"\\((k{-}1)\\)-approximation":[125],"Kortsarz,":[128],"Langberg,":[129],"Nutov,":[131],"[SIAM":[132],"Discrete":[134],"Math.,":[135],"24":[136],"(2010),":[137],"pp.":[138],"255\u2013269].":[139],"More":[140],"generally,":[141],"\\(H\\)":[146,208,221],"we":[147],"introduce":[148],"parameter":[151],"\\(f(H)\\)":[152],"which":[154],"\\(H\\)-copies,":[170],"\\(f(H)t+":[179],"\\(H\\)-copies":[185,191],"\\(f(H)t\\).":[200],"almost":[206],"holds":[210,223],"\\(f(H)":[212,225],"\\approx":[213],"|E(H)|/2\\)":[214],"\\(k\\)-vertex":[219],"tournament":[220],"\\le":[226],"\\lfloor":[227],"k^2/4":[228],"\\rfloor\\).KeywordscycleapproximationcoveringpackingMSC":[229],"codes05C2005C3505C3868R10":[230]},"counts_by_year":[],"updated_date":"2025-12-25T23:11:45.687758","created_date":"2025-10-10T00:00:00"}