{"id":"https://openalex.org/W2051080684","doi":"https://doi.org/10.1007/s00453-004-1131-0","title":"Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One","display_name":"Approximating Maximum Weight Cycle Covers in Directed Graphs with Weights Zero and One","publication_year":2005,"publication_date":"2005-02-07","ids":{"openalex":"https://openalex.org/W2051080684","doi":"https://doi.org/10.1007/s00453-004-1131-0","mag":"2051080684"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-004-1131-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1131-0","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/20.500.11850/33134","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5035530886","display_name":"Markus Bl\u00e4ser","orcid":"https://orcid.org/0000-0002-1750-9036"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":true,"raw_author_name":"Markus Bl\u00e4ser","raw_affiliation_strings":["Institut fur Theoretische Informatik, IFW B46.2, ETH Zurich, ETH Zentrum, 8092 Zurich, Switzerland","Institut fur Theoretische Informatik, IFW B46.2, ETH Zurich, ETH Zentrum, 8092 Zurich"],"affiliations":[{"raw_affiliation_string":"Institut fur Theoretische Informatik, IFW B46.2, ETH Zurich, ETH Zentrum, 8092 Zurich, Switzerland","institution_ids":["https://openalex.org/I35440088"]},{"raw_affiliation_string":"Institut fur Theoretische Informatik, IFW B46.2, ETH Zurich, ETH Zentrum, 8092 Zurich","institution_ids":["https://openalex.org/I35440088"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002315999","display_name":"Bodo Manthey","orcid":"https://orcid.org/0000-0001-6278-5059"},"institutions":[{"id":"https://openalex.org/I9341345","display_name":"University of L\u00fcbeck","ror":"https://ror.org/00t3r8h32","country_code":"DE","type":"education","lineage":["https://openalex.org/I9341345"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Bodo Manthey","raw_affiliation_strings":["Institut fur Theoretische Informatik, Universitat zu Lubeck, Ratzeburger Allee 160, 23538 Lubeck, Germany","Institut fur Theoretische Informatik, Universitat zu Lubeck, Ratzeburger Allee 160, 23538 Lubeck"],"affiliations":[{"raw_affiliation_string":"Institut fur Theoretische Informatik, Universitat zu Lubeck, Ratzeburger Allee 160, 23538 Lubeck, Germany","institution_ids":["https://openalex.org/I9341345"]},{"raw_affiliation_string":"Institut fur Theoretische Informatik, Universitat zu Lubeck, Ratzeburger Allee 160, 23538 Lubeck","institution_ids":["https://openalex.org/I9341345"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5035530886"],"corresponding_institution_ids":["https://openalex.org/I35440088"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":4.0399,"has_fulltext":false,"cited_by_count":34,"citation_normalized_percentile":{"value":0.94153226,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"42","issue":"2","first_page":"121","last_page":"139"},"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.9998999834060669,"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.9998999834060669,"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.9987000226974487,"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.9983000159263611,"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.8056693077087402},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7543665170669556},{"id":"https://openalex.org/keywords/minimum-weight","display_name":"Minimum weight","score":0.5751914381980896},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.5516130924224854},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.546302318572998},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.531954288482666},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.5262129306793213},{"id":"https://openalex.org/keywords/feedback-arc-set","display_name":"Feedback arc set","score":0.4993412494659424},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4636688232421875},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.45226234197616577},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4383859932422638},{"id":"https://openalex.org/keywords/directed-graph","display_name":"Directed graph","score":0.4340894818305969},{"id":"https://openalex.org/keywords/zero","display_name":"Zero (linguistics)","score":0.4206223785877228},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41188570857048035},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24438342452049255},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.10452419519424438}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8056693077087402},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7543665170669556},{"id":"https://openalex.org/C2778945305","wikidata":"https://www.wikidata.org/wiki/Q6865502","display_name":"Minimum weight","level":2,"score":0.5751914381980896},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.5516130924224854},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.546302318572998},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.531954288482666},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.5262129306793213},{"id":"https://openalex.org/C157951044","wikidata":"https://www.wikidata.org/wiki/Q1400910","display_name":"Feedback arc set","level":5,"score":0.4993412494659424},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4636688232421875},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.45226234197616577},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4383859932422638},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.4340894818305969},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.4206223785877228},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41188570857048035},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24438342452049255},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.10452419519424438},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"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/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1007/s00453-004-1131-0","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-004-1131-0","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:ris.utwente.nl:openaire_cris_publications/3833c05e-a974-46f8-9058-137a426e7198","is_oa":false,"landing_page_url":"https://research.utwente.nl/en/publications/3833c05e-a974-46f8-9058-137a426e7198","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bl\u00e4ser, M & Manthey, B 2005, 'Approximating maximum weight cycle covers in directed graphs with weights zero and one', Algorithmica, vol. 42, no. 2, pp. 121-139. https://doi.org/10.1007/s00453-004-1131-0","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.89.5990","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.89.5990","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www-cc.cs.uni-sb.de/manthey/publications/Algorithmica_BlaeserManthey_CycleCovers01.pdf","raw_type":"text"},{"id":"pmh:oai:doc.rero.ch:315085","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4306400148","display_name":"reroDoc Digital Library","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/33134","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/33134","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 42 (2)","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"doi:10.3929/ethz-b-000033134","is_oa":true,"landing_page_url":"https://doi.org/10.3929/ethz-b-000033134","pdf_url":null,"source":{"id":"https://openalex.org/S7407051236","display_name":"ETH Z\u00fcrich Research Collection","issn_l":null,"issn":[],"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article-journal"}],"best_oa_location":{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/33134","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/33134","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Algorithmica, 42 (2)","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W959799004","https://openalex.org/W1490932874","https://openalex.org/W1521148214","https://openalex.org/W1522051960","https://openalex.org/W1915280757","https://openalex.org/W1977545325","https://openalex.org/W2002089154","https://openalex.org/W2006912660","https://openalex.org/W2011039300","https://openalex.org/W2012391569","https://openalex.org/W2019036002","https://openalex.org/W2021625223","https://openalex.org/W2038225707","https://openalex.org/W2059608229","https://openalex.org/W2086077818","https://openalex.org/W2107750985","https://openalex.org/W2130200244","https://openalex.org/W2137560895","https://openalex.org/W2141355868","https://openalex.org/W2157529519","https://openalex.org/W2317309498","https://openalex.org/W2324108981","https://openalex.org/W2476096155","https://openalex.org/W2486715098","https://openalex.org/W2914372558","https://openalex.org/W4233756358","https://openalex.org/W4294358747"],"related_works":["https://openalex.org/W4241541331","https://openalex.org/W2259723333","https://openalex.org/W1002323541","https://openalex.org/W1980481456","https://openalex.org/W1511577792","https://openalex.org/W79682516","https://openalex.org/W2949833368","https://openalex.org/W4300545322","https://openalex.org/W2014769093","https://openalex.org/W2963782526"],"abstract_inverted_index":null,"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}