{"id":"https://openalex.org/W2030375943","doi":"https://doi.org/10.1016/s0166-218x(00)00366-8","title":"An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function","display_name":"An approximation guarantee of the greedy descent algorithm for minimizing a supermodular set function","publication_year":2001,"publication_date":"2001-10-01","ids":{"openalex":"https://openalex.org/W2030375943","doi":"https://doi.org/10.1016/s0166-218x(00)00366-8","mag":"2030375943"},"language":"en","primary_location":{"id":"doi:10.1016/s0166-218x(00)00366-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(00)00366-8","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X00003668/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.sciencedirect.com/science/article/pii/S0166218X00003668/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5057430885","display_name":"Victor Il\u2019ev","orcid":"https://orcid.org/0000-0002-4675-3724"},"institutions":[{"id":"https://openalex.org/I269199756","display_name":"Omsk State University","ror":"https://ror.org/01k6vxj52","country_code":"RU","type":"education","lineage":["https://openalex.org/I269199756"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Victor P. Il'ev","raw_affiliation_strings":["Department of Mathematics, Omsk State University, Pr. Mira, 55A, 644077 Omsk, Russia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, Omsk State University, Pr. Mira, 55A, 644077 Omsk, Russia","institution_ids":["https://openalex.org/I269199756"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5057430885"],"corresponding_institution_ids":["https://openalex.org/I269199756"],"apc_list":{"value":3090,"currency":"USD","value_usd":3090},"apc_paid":null,"fwci":0.4444,"has_fulltext":true,"cited_by_count":37,"citation_normalized_percentile":{"value":0.65025284,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"114","issue":"1-3","first_page":"131","last_page":"146"},"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.9994999766349792,"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.9994999766349792,"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.9951000213623047,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9725000262260437,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7867188453674316},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.7787214517593384},{"id":"https://openalex.org/keywords/descent","display_name":"Descent (aeronautics)","score":0.6229515671730042},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6173578500747681},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5934019684791565},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5921196937561035},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.5849807262420654},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5782646536827087},{"id":"https://openalex.org/keywords/greedy-randomized-adaptive-search-procedure","display_name":"Greedy randomized adaptive search procedure","score":0.5680872797966003},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.537345826625824},{"id":"https://openalex.org/keywords/set-cover-problem","display_name":"Set cover problem","score":0.44753244519233704},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41645801067352295},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.38848912715911865},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.1298697590827942}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7867188453674316},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.7787214517593384},{"id":"https://openalex.org/C2776637919","wikidata":"https://www.wikidata.org/wiki/Q624380","display_name":"Descent (aeronautics)","level":2,"score":0.6229515671730042},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6173578500747681},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5934019684791565},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5921196937561035},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.5849807262420654},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5782646536827087},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.5680872797966003},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.537345826625824},{"id":"https://openalex.org/C100808899","wikidata":"https://www.wikidata.org/wiki/Q1192100","display_name":"Set cover problem","level":3,"score":0.44753244519233704},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41645801067352295},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.38848912715911865},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.1298697590827942},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","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":1,"locations":[{"id":"doi:10.1016/s0166-218x(00)00366-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(00)00366-8","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X00003668/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s0166-218x(00)00366-8","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s0166-218x(00)00366-8","pdf_url":"https://www.sciencedirect.com/science/article/pii/S0166218X00003668/pdf","source":{"id":"https://openalex.org/S171741597","display_name":"Discrete Applied Mathematics","issn_l":"0166-218X","issn":["0166-218X","1872-6771"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Discrete Applied Mathematics","raw_type":"journal-article"},"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.4099999964237213,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321079","display_name":"Russian Foundation for Basic Research","ror":"https://ror.org/02mh1ke95"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2030375943.pdf","grobid_xml":"https://content.openalex.org/works/W2030375943.grobid-xml"},"referenced_works_count":5,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W1973315504","https://openalex.org/W2011193572","https://openalex.org/W2080169294","https://openalex.org/W3121064764"],"related_works":["https://openalex.org/W2809828719","https://openalex.org/W2147086810","https://openalex.org/W4376639562","https://openalex.org/W1594413663","https://openalex.org/W1496354680","https://openalex.org/W2102199239","https://openalex.org/W1497312391","https://openalex.org/W2952847377","https://openalex.org/W2099799577","https://openalex.org/W1517616038"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-08-23T07:36:19.812096","created_date":"2025-10-10T00:00:00"}