{"id":"https://openalex.org/W2406887087","doi":"https://doi.org/10.1201/9781351236423-5","title":"Recursive Greedy Methods","display_name":"Recursive Greedy Methods","publication_year":2018,"publication_date":"2018-05-15","ids":{"openalex":"https://openalex.org/W2406887087","doi":"https://doi.org/10.1201/9781351236423-5","mag":"2406887087"},"language":"en","primary_location":{"id":"doi:10.1201/9781351236423-5","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781351236423-5","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Approximation Algorithms and Metaheuristics, Second Edition","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/A5064059676","display_name":"Guy Even","orcid":"https://orcid.org/0000-0001-5407-330X"},"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":true,"raw_author_name":"Guy Even","raw_affiliation_strings":["Tel Aviv University *"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Tel Aviv University *","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5064059676"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":0.7432,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.74413146,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"71","last_page":"84"},"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.9987999796867371,"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.9987999796867371,"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/T12923","display_name":"Digital Image Processing Techniques","score":0.9945999979972839,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/T12176","display_name":"Optimization and Packing Problems","score":0.9940000176429749,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing 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/greedy-algorithm","display_name":"Greedy algorithm","score":0.4926324486732483},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4755387306213379},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35812199115753174},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2752459645271301}],"concepts":[{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4926324486732483},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4755387306213379},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35812199115753174},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2752459645271301}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1201/9781351236423-5","is_oa":false,"landing_page_url":"https://doi.org/10.1201/9781351236423-5","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Handbook of Approximation Algorithms and Metaheuristics, Second Edition","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.146.5048","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.146.5048","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eng.tau.ac.il/~guy/Papers/RecursiveGreedy.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1591968161","https://openalex.org/W1977712294","https://openalex.org/W1986201860","https://openalex.org/W1990571240","https://openalex.org/W1994698869","https://openalex.org/W2005771129","https://openalex.org/W2009976792","https://openalex.org/W2610052675"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2899084033","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W2748952813","https://openalex.org/W1531601525"],"abstract_inverted_index":{"Greedy":[0],"algorithms":[1],"are":[2],"often":[3],"the":[4,39,53,64,73,77,92,98,101,105],"first":[5],"algorithm":[6,75,90,115],"that":[7,62,104],"one":[8],"considers":[9],"for":[10,76,91,118],"various":[11],"optimization":[12],"problems,":[13],"and,":[14],"in":[15,120],"particular,":[16],"covering":[17],"problems.":[18],"The":[19,47,70,114],"idea":[20],"is":[21,50,57,108,116,131],"very":[22],"simple:":[23],"try":[24],"to":[25,43,58,68],"build":[26],"a":[27,32,44,87,123,128],"solution":[28,130],"incrementally":[29],"by":[30],"augmenting":[31],"partial":[33,129],"solution.":[34],"In":[35],"each":[36],"iteration,":[37],"select":[38,59],"\"best\"":[40],"augmentation":[41,61,126],"according":[42],"simple":[45],"criterion.":[46],"term":[48],"greedy":[49,74,89],"used":[51],"because":[52],"most":[54],"common":[55],"criterion":[56],"an":[60,109,132],"minimizes":[63],"ratio":[65],"of":[66,127],"\"cost\"":[67],"\"advantage.\"":[69],"chapter":[71,102],"reviews":[72],"Set-Cover":[78],"(SC)":[79],"problem":[80],"and":[81],"its":[82],"analysis.":[83],"It":[84],"also":[85],"presents":[86],"recursive":[88],"l-shallow":[93],"k-DST":[94],"problem.":[95,134],"Based":[96],"on":[97],"layering":[99],"transformation,":[100],"suggests":[103],"input":[106],"graph":[107],"l-layered":[110],"acyclic":[111],"directed":[112],"graph.":[113],"designed":[117],"problems":[119],"which":[121],"finding":[122],"minimum":[124],"density":[125],"NP-hard":[133]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2025-10-10T00:00:00"}