{"id":"https://openalex.org/W1979224980","doi":"https://doi.org/10.1007/s00453-010-9408-y","title":"Approximation Algorithms for k-hurdle Problems","display_name":"Approximation Algorithms for k-hurdle Problems","publication_year":2010,"publication_date":"2010-04-01","ids":{"openalex":"https://openalex.org/W1979224980","doi":"https://doi.org/10.1007/s00453-010-9408-y","mag":"1979224980"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-010-9408-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-010-9408-y","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"],"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/A5083958648","display_name":"Brian C. Dean","orcid":"https://orcid.org/0009-0000-0904-4681"},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Brian C. Dean","raw_affiliation_strings":["School of Computing, Clemson University, Clemson, SC, USA","Clemson University School of Computing Clemson SC USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, Clemson University, Clemson, SC, USA","institution_ids":["https://openalex.org/I8078737"]},{"raw_affiliation_string":"Clemson University School of Computing Clemson SC USA","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091174769","display_name":"Adam Griffis","orcid":null},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adam Griffis","raw_affiliation_strings":["School of Computing, Clemson University, Clemson, SC, USA","Clemson University School of Computing Clemson SC USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, Clemson University, Clemson, SC, USA","institution_ids":["https://openalex.org/I8078737"]},{"raw_affiliation_string":"Clemson University School of Computing Clemson SC USA","institution_ids":["https://openalex.org/I8078737"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006200442","display_name":"Ojas Parekh","orcid":"https://orcid.org/0000-0003-2689-9264"},"institutions":[{"id":"https://openalex.org/I150468666","display_name":"Emory University","ror":"https://ror.org/03czfpz43","country_code":"US","type":"education","lineage":["https://openalex.org/I150468666"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ojas Parekh","raw_affiliation_strings":["Mathematics and Computer Science Department, Emory University, Atlanta, GA, USA","Emory University, Mathematics and Computer Science Department, Atlanta, GA, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"Mathematics and Computer Science Department, Emory University, Atlanta, GA, USA","institution_ids":["https://openalex.org/I150468666"]},{"raw_affiliation_string":"Emory University, Mathematics and Computer Science Department, Atlanta, GA, USA#TAB#","institution_ids":["https://openalex.org/I150468666"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5029830099","display_name":"Adam Whitley","orcid":null},"institutions":[{"id":"https://openalex.org/I8078737","display_name":"Clemson University","ror":"https://ror.org/037s24f05","country_code":"US","type":"education","lineage":["https://openalex.org/I8078737"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Adam Whitley","raw_affiliation_strings":["School of Computing, Clemson University, Clemson, SC, USA","Clemson University School of Computing Clemson SC USA"],"affiliations":[{"raw_affiliation_string":"School of Computing, Clemson University, Clemson, SC, USA","institution_ids":["https://openalex.org/I8078737"]},{"raw_affiliation_string":"Clemson University School of Computing Clemson SC USA","institution_ids":["https://openalex.org/I8078737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5083958648"],"corresponding_institution_ids":["https://openalex.org/I8078737"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.3417,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.59811356,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"59","issue":"1","first_page":"81","last_page":"93"},"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.9907000064849854,"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.9907000064849854,"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9663000106811523,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11807","display_name":"Infrastructure Resilience and Vulnerability Analysis","score":0.9641000032424927,"subfield":{"id":"https://openalex.org/subfields/2205","display_name":"Civil and Structural 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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7335159778594971},{"id":"https://openalex.org/keywords/vertex-cover","display_name":"Vertex cover","score":0.6957141160964966},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6924842000007629},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.6794157028198242},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6476830840110779},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6269875168800354},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5949417948722839},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49460646510124207},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4662783145904541},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.46611884236335754},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.45249056816101074},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.445669025182724},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.4359205365180969},{"id":"https://openalex.org/keywords/kernelization","display_name":"Kernelization","score":0.4356034994125366},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41573256254196167},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.39309853315353394},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38488101959228516},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.37691381573677063},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.30612075328826904},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2108643352985382}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7335159778594971},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.6957141160964966},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6924842000007629},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.6794157028198242},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6476830840110779},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6269875168800354},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5949417948722839},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49460646510124207},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4662783145904541},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.46611884236335754},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.45249056816101074},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.445669025182724},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.4359205365180969},{"id":"https://openalex.org/C207225210","wikidata":"https://www.wikidata.org/wiki/Q1759539","display_name":"Kernelization","level":3,"score":0.4356034994125366},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41573256254196167},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.39309853315353394},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38488101959228516},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.37691381573677063},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.30612075328826904},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2108643352985382},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1007/s00453-010-9408-y","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-010-9408-y","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:CiteSeerX.psu:10.1.1.122.7397","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.122.7397","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.clemson.edu/~bcdean/k_hurdle.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.126.1739","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.1739","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.clemson.edu/~bcdean/k_hurdle.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W150908699","https://openalex.org/W282776240","https://openalex.org/W435007089","https://openalex.org/W1496175379","https://openalex.org/W1500396446","https://openalex.org/W1886894449","https://openalex.org/W1964119857","https://openalex.org/W1968907718","https://openalex.org/W1977577374","https://openalex.org/W1983839752","https://openalex.org/W1986538507","https://openalex.org/W1994612875","https://openalex.org/W2010004564","https://openalex.org/W2013355418","https://openalex.org/W2019062750","https://openalex.org/W2044343300","https://openalex.org/W2061872629","https://openalex.org/W2065320942","https://openalex.org/W2069324954","https://openalex.org/W2083658929","https://openalex.org/W2093517413","https://openalex.org/W2094463866","https://openalex.org/W2096411231","https://openalex.org/W2104768456","https://openalex.org/W2133494553","https://openalex.org/W2152986618","https://openalex.org/W2167236203","https://openalex.org/W3009415557","https://openalex.org/W3121576764","https://openalex.org/W4247051268"],"related_works":["https://openalex.org/W2886237949","https://openalex.org/W4289276807","https://openalex.org/W2952288771","https://openalex.org/W2168711306","https://openalex.org/W4388999007","https://openalex.org/W1597649928","https://openalex.org/W2096768449","https://openalex.org/W1759554648","https://openalex.org/W2141946535","https://openalex.org/W2044818254"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}
