{"id":"https://openalex.org/W1522772123","doi":"https://doi.org/10.1007/978-3-642-17517-6_37","title":"Lower Bounds for Howard\u2019s Algorithm for Finding Minimum Mean-Cost Cycles","display_name":"Lower Bounds for Howard\u2019s Algorithm for Finding Minimum Mean-Cost Cycles","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W1522772123","doi":"https://doi.org/10.1007/978-3-642-17517-6_37","mag":"1522772123"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-17517-6_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-17517-6_37","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5049011416","display_name":"Thomas Dueholm Hansen","orcid":null},"institutions":[{"id":"https://openalex.org/I204337017","display_name":"Aarhus University","ror":"https://ror.org/01aj84f44","country_code":"DK","type":"education","lineage":["https://openalex.org/I204337017"]}],"countries":["DK"],"is_corresponding":true,"raw_author_name":"Thomas Dueholm Hansen","raw_affiliation_strings":["Department of Computer Science, Aarhus University, Denmark","Aarhus University"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Aarhus University, Denmark","institution_ids":["https://openalex.org/I204337017"]},{"raw_affiliation_string":"Aarhus University","institution_ids":["https://openalex.org/I204337017"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005525211","display_name":"Uri Zwick","orcid":"https://orcid.org/0000-0002-7638-7710"},"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":"Uri Zwick","raw_affiliation_strings":["School of Computer Science, Tel Aviv University, Tel Aviv, 69978, Israel","Tel-Aviv  University"],"affiliations":[{"raw_affiliation_string":"School of Computer Science, Tel Aviv University, Tel Aviv, 69978, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel-Aviv  University","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049011416"],"corresponding_institution_ids":["https://openalex.org/I204337017"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":2.1813,"has_fulltext":false,"cited_by_count":16,"citation_normalized_percentile":{"value":0.86866259,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"415","last_page":"426"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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/T10142","display_name":"Formal Methods in Verification","score":0.9991999864578247,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9977999925613403,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/computer-science","display_name":"Computer science","score":0.6043658256530762},{"id":"https://openalex.org/keywords/markov-decision-process","display_name":"Markov decision process","score":0.5557271838188171},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5120185017585754},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49513521790504456},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.48033490777015686},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4615054428577423},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.44106587767601013},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4289551079273224},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.35344475507736206},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3311879634857178},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.22307392954826355},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2128610908985138},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08176138997077942}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6043658256530762},{"id":"https://openalex.org/C106189395","wikidata":"https://www.wikidata.org/wiki/Q176789","display_name":"Markov decision process","level":3,"score":0.5557271838188171},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5120185017585754},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49513521790504456},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.48033490777015686},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4615054428577423},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.44106587767601013},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4289551079273224},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.35344475507736206},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3311879634857178},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.22307392954826355},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2128610908985138},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08176138997077942},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","level":1,"score":0.0},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/978-3-642-17517-6_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-17517-6_37","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/acd1c020-ab40-497e-8ef1-63d0602fb624","is_oa":false,"landing_page_url":"https://pure.au.dk/portal/en/publications/acd1c020-ab40-497e-8ef1-63d0602fb624","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Hansen, T D & Zwick, U 2010, 'Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles', Lecture Notes in Computer Science, vol. 6506, pp. 415-426. https://doi.org/10.1007/978-3-642-17517-6_37","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.174.7896","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.7896","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.au.dk/%7Etdh/papers/policy.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.6899999976158142,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W342309696","https://openalex.org/W1928484725","https://openalex.org/W1983093080","https://openalex.org/W2002531683","https://openalex.org/W2027029507","https://openalex.org/W2028145673","https://openalex.org/W2036772106","https://openalex.org/W2048790997","https://openalex.org/W2097004206","https://openalex.org/W2106299112","https://openalex.org/W2141076336","https://openalex.org/W2141252092","https://openalex.org/W2182244178","https://openalex.org/W2227557434","https://openalex.org/W2334782222","https://openalex.org/W2341171179","https://openalex.org/W3105140593","https://openalex.org/W4213060883"],"related_works":["https://openalex.org/W2374829073","https://openalex.org/W2089134982","https://openalex.org/W91039700","https://openalex.org/W1506128430","https://openalex.org/W2123365683","https://openalex.org/W3107976745","https://openalex.org/W4205507536","https://openalex.org/W1871632135","https://openalex.org/W2126291394","https://openalex.org/W2125117695"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"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"}