{"id":"https://openalex.org/W2898674122","doi":"https://doi.org/10.1109/ccta.2018.8511628","title":"Greedily Excluding Algorithm for Submodular Maximization","display_name":"Greedily Excluding Algorithm for Submodular Maximization","publication_year":2018,"publication_date":"2018-08-01","ids":{"openalex":"https://openalex.org/W2898674122","doi":"https://doi.org/10.1109/ccta.2018.8511628","mag":"2898674122"},"language":"en","primary_location":{"id":"doi:10.1109/ccta.2018.8511628","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccta.2018.8511628","pdf_url":null,"source":{"id":"https://openalex.org/S4306498315","display_name":"2018 IEEE Conference on Control Technology and Applications (CCTA)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Control Technology and Applications (CCTA)","raw_type":"proceedings-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/A5050318859","display_name":"Min-Guk Seo","orcid":"https://orcid.org/0000-0002-3225-7738"},"institutions":[{"id":"https://openalex.org/I82284825","display_name":"Cranfield University","ror":"https://ror.org/05cncd958","country_code":"GB","type":"education","lineage":["https://openalex.org/I82284825"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Min-Guk Seo","raw_affiliation_strings":["Transport and Manufacturing (SATM), Cranfield University, Cranfield, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Transport and Manufacturing (SATM), Cranfield University, Cranfield, United Kingdom","institution_ids":["https://openalex.org/I82284825"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001666073","display_name":"Hyo\u2010Sang Shin","orcid":"https://orcid.org/0000-0001-9938-0370"},"institutions":[{"id":"https://openalex.org/I82284825","display_name":"Cranfield University","ror":"https://ror.org/05cncd958","country_code":"GB","type":"education","lineage":["https://openalex.org/I82284825"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Hyo-Sang Shin","raw_affiliation_strings":["Transport and Manufacturing (SATM), Cranfield University, Cranfield, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Transport and Manufacturing (SATM), Cranfield University, Cranfield, United Kingdom","institution_ids":["https://openalex.org/I82284825"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5050318859"],"corresponding_institution_ids":["https://openalex.org/I82284825"],"apc_list":null,"apc_paid":null,"fwci":1.0862,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.76325088,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"1680","last_page":"1685"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9975000023841858,"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"}},{"id":"https://openalex.org/T10237","display_name":"Cryptography and Data Security","score":0.9973000288009644,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.8973985910415649},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6674572229385376},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5860548615455627},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5206072330474854},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4827934503555298},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.33541274070739746},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2876218557357788},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2133515477180481}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8973985910415649},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6674572229385376},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5860548615455627},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5206072330474854},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4827934503555298},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33541274070739746},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2876218557357788},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2133515477180481}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ccta.2018.8511628","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ccta.2018.8511628","pdf_url":null,"source":{"id":"https://openalex.org/S4306498315","display_name":"2018 IEEE Conference on Control Technology and Applications (CCTA)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE Conference on Control Technology and Applications (CCTA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1517928915","https://openalex.org/W1680189815","https://openalex.org/W1757790940","https://openalex.org/W1938602245","https://openalex.org/W2011193572","https://openalex.org/W2100729440","https://openalex.org/W2131824593","https://openalex.org/W2145825677","https://openalex.org/W2148134592","https://openalex.org/W2202942124","https://openalex.org/W2239902130","https://openalex.org/W2252172643","https://openalex.org/W2263717697","https://openalex.org/W2964202295","https://openalex.org/W3003506411","https://openalex.org/W4231490457","https://openalex.org/W4251076636","https://openalex.org/W6631046737","https://openalex.org/W6637754763","https://openalex.org/W6679608865"],"related_works":["https://openalex.org/W2896347948","https://openalex.org/W2950500962","https://openalex.org/W2915041254","https://openalex.org/W4302557420","https://openalex.org/W2950365512","https://openalex.org/W1608444752","https://openalex.org/W3204684126","https://openalex.org/W2062310236","https://openalex.org/W3013568067","https://openalex.org/W4299354108"],"abstract_inverted_index":{"This":[0],"paper":[1],"develops":[2],"an":[3,55],"approximation":[4,120],"algorithm":[5,45,72,95],"for":[6,82],"maximization":[7],"of":[8,20,28,92,103,118],"monotone":[9],"submodular":[10],"reward":[11],"function":[12],"with":[13,36,85,101],"a":[14,83,86],"cardinality":[15,88],"constraint.":[16,89],"The":[17,43,90],"main":[18],"focus":[19],"our":[21],"development":[22],"is":[23,46,57,110],"to":[24,63,73,114],"enhances":[25],"the":[26,37,48,60,65,71,76,93,116,119],"level":[27,78],"guaranteed":[29],"optimality,":[30],"computational":[31,80],"complexity":[32,81],"or":[33],"both":[34,75],"compared":[35,100],"well-known":[38,104],"existing":[39],"greedy":[40],"based":[41],"approaches.":[42],"proposed":[44,94],"called":[47],"greedily":[49],"excluding":[50],"algorithm.":[51],"In":[52],"this":[53,69],"algorithm,":[54],"element":[56],"removed":[58],"from":[59],"ground":[61],"set":[62,67],"find":[64],"solution":[66],"and":[68,79,99],"allows":[70],"improve":[74],"optimality":[77],"problem":[84],"high":[87],"characteristics":[91],"are":[96],"mathematically":[97],"analysed":[98],"those":[102],"greedy-based":[105],"algorithms.":[106],"A":[107],"case":[108],"study":[109],"also":[111],"carried":[112],"out":[113],"demonstrate":[115],"performance":[117],"algorithms":[121],"developed.":[122]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}