{"id":"https://openalex.org/W1593801765","doi":"https://doi.org/10.1137/060676003","title":"On Approximating Restricted Cycle Covers","display_name":"On Approximating Restricted Cycle Covers","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W1593801765","doi":"https://doi.org/10.1137/060676003","mag":"1593801765"},"language":"en","primary_location":{"id":"doi:10.1137/060676003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060676003","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://research.utwente.nl/en/publications/28a5fc6d-a241-4efe-ba7c-2cc1f6fb3b0a","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002315999","display_name":"Bodo Manthey","orcid":"https://orcid.org/0000-0001-6278-5059"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bodo Manthey","raw_affiliation_strings":["[email\u00a0protected]ni-sb.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"[email\u00a0protected]ni-sb.de#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":["https://openalex.org/A5002315999"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":2.857,"has_fulltext":true,"cited_by_count":17,"citation_normalized_percentile":{"value":0.89938553,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"38","issue":"1","first_page":"181","last_page":"206"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10720","display_name":"Complexity and Algorithms in Graphs","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/T10374","display_name":"Advanced Graph Theory Research","score":0.9950000047683716,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/combinatorics","display_name":"Combinatorics","score":0.7905898690223694},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6960557699203491},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.6314256191253662},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6293148994445801},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.610637366771698},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.5322371125221252},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5082578063011169},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.49820852279663086},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4775710701942444},{"id":"https://openalex.org/keywords/feedback-vertex-set","display_name":"Feedback vertex set","score":0.44747963547706604},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4446059763431549},{"id":"https://openalex.org/keywords/cycle-basis","display_name":"Cycle basis","score":0.43635791540145874},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.11247548460960388},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10631158947944641}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7905898690223694},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6960557699203491},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.6314256191253662},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6293148994445801},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.610637366771698},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.5322371125221252},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5082578063011169},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.49820852279663086},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4775710701942444},{"id":"https://openalex.org/C28723256","wikidata":"https://www.wikidata.org/wiki/Q1400918","display_name":"Feedback vertex set","level":4,"score":0.44747963547706604},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4446059763431549},{"id":"https://openalex.org/C26752605","wikidata":"https://www.wikidata.org/wiki/Q16766188","display_name":"Cycle basis","level":5,"score":0.43635791540145874},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.11247548460960388},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10631158947944641},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/060676003","is_oa":false,"landing_page_url":"https://doi.org/10.1137/060676003","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"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 Computing","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire/28a5fc6d-a241-4efe-ba7c-2cc1f6fb3b0a","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/28a5fc6d-a241-4efe-ba7c-2cc1f6fb3b0a","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Manthey, B 2008, 'On approximating restricted cycle covers', SIAM journal on computing, vol. 38, no. 1, pp. 181-206. https://doi.org/10.1137/060676003","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:ris.utwente.nl:publications/28a5fc6d-a241-4efe-ba7c-2cc1f6fb3b0a","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":{"id":"pmh:oai:ris.utwente.nl:openaire/28a5fc6d-a241-4efe-ba7c-2cc1f6fb3b0a","is_oa":true,"landing_page_url":"https://research.utwente.nl/en/publications/28a5fc6d-a241-4efe-ba7c-2cc1f6fb3b0a","pdf_url":null,"source":{"id":"https://openalex.org/S4406922991","display_name":"University of Twente Research Information","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Manthey, B 2008, 'On approximating restricted cycle covers', SIAM journal on computing, vol. 38, no. 1, pp. 181-206. https://doi.org/10.1137/060676003","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320308380","display_name":"Yale University","ror":"https://ror.org/03v76x132"},{"id":"https://openalex.org/F4320320875","display_name":"Deutscher Akademischer Austauschdienst","ror":"https://ror.org/039djdh30"},{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"},{"id":"https://openalex.org/F4320322414","display_name":"Universit\u00e4t zu L\u00fcbeck","ror":"https://ror.org/00t3r8h32"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":42,"referenced_works":["https://openalex.org/W21325375","https://openalex.org/W1522051960","https://openalex.org/W1553729051","https://openalex.org/W1557818090","https://openalex.org/W1620812866","https://openalex.org/W1915280757","https://openalex.org/W1975510914","https://openalex.org/W1977545325","https://openalex.org/W1978451969","https://openalex.org/W1980842804","https://openalex.org/W1994993627","https://openalex.org/W1995435632","https://openalex.org/W1996962956","https://openalex.org/W1999341643","https://openalex.org/W2006912660","https://openalex.org/W2011039300","https://openalex.org/W2012391569","https://openalex.org/W2019570365","https://openalex.org/W2021625223","https://openalex.org/W2025698306","https://openalex.org/W2034350206","https://openalex.org/W2037050365","https://openalex.org/W2038225707","https://openalex.org/W2051080684","https://openalex.org/W2053913299","https://openalex.org/W2054420170","https://openalex.org/W2056215713","https://openalex.org/W2059608229","https://openalex.org/W2069381123","https://openalex.org/W2086077818","https://openalex.org/W2102403605","https://openalex.org/W2107750985","https://openalex.org/W2129220807","https://openalex.org/W2129303870","https://openalex.org/W2134761228","https://openalex.org/W2137560895","https://openalex.org/W2141355868","https://openalex.org/W2167197687","https://openalex.org/W2317309498","https://openalex.org/W2401610261","https://openalex.org/W2571302302","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W1560183925","https://openalex.org/W2048322630","https://openalex.org/W2024517697","https://openalex.org/W2079263399","https://openalex.org/W2173656554","https://openalex.org/W2963350429","https://openalex.org/W2234187453","https://openalex.org/W4302317037","https://openalex.org/W2405126695","https://openalex.org/W2951232303"],"abstract_inverted_index":{"A":[0],"cycle":[1,26,34,44],"cover":[2,23,27,45],"of":[3,9,17,32,42,46,53,56,68,86,97,122,126,135,144,149],"a":[4,7,25,43,133,142],"graph":[5,49],"is":[6,15,24,35,50,94],"set":[8,38],"cycles":[10],"such":[11],"that":[12,119],"every":[13,33],"vertex":[14],"part":[16],"exactly":[18],"one":[19,74],"cycle.":[20],"An":[21],"L-cycle":[22,70,84,124],"in":[28,36,89,146],"which":[29],"the":[30,37,51,54,64,73,104,114,120,147],"length":[31],"L.":[39,157],"The":[40],"weight":[41,88,128],"an":[47],"edge-weighted":[48],"sum":[52],"weights":[55,106],"its":[57],"edges.":[58],"We":[59],"come":[60],"close":[61],"to":[62,109],"settling":[63],"complexity":[65],"and":[66,91,111,140],"approximability":[67],"computing":[69,83,123],"covers.":[71],"On":[72,113],"hand,":[75,116],"we":[76,117],"show":[77,118],"that,":[78],"for":[79,137,154],"almost":[80],"all":[81],"L,":[82],"covers":[85,125],"maximum":[87,127],"directed":[90,150],"undirected":[92,138],"graphs":[93,139],"$\\mathsf{APX}$-hard.":[95],"Most":[96],"our":[98],"hardness":[99],"results":[100],"hold":[101],"even":[102],"if":[103],"edge":[105],"are":[107],"restricted":[108],"zero":[110],"one.":[112],"other":[115],"problem":[121],"can":[129],"be":[130],"approximated":[131],"within":[132,141],"factor":[134,143],"2":[136],"$8/3$":[145],"case":[148],"graphs.":[151],"This":[152],"holds":[153],"arbitrary":[155],"sets":[156]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}