{"id":"https://openalex.org/W4415593560","doi":"https://doi.org/10.1109/tac.2025.3626265","title":"A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems","display_name":"A Performance Bound for the Greedy Algorithm in a Generalized Class of String Optimization Problems","publication_year":2025,"publication_date":"2025-10-27","ids":{"openalex":"https://openalex.org/W4415593560","doi":"https://doi.org/10.1109/tac.2025.3626265"},"language":null,"primary_location":{"id":"doi:10.1109/tac.2025.3626265","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2025.3626265","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","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/A5008464915","display_name":"Brandon Van Over","orcid":null},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brandon Van Over","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA"],"raw_orcid":"https://orcid.org/0009-0005-9325-3625","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Bowen Li","orcid":"https://orcid.org/0000-0001-6684-8627"},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Bowen Li","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA"],"raw_orcid":"https://orcid.org/0000-0001-6684-8627","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070385137","display_name":"Edwin K. P. Chong","orcid":"https://orcid.org/0000-0002-7622-4815"},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Edwin K. P. Chong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA"],"raw_orcid":"https://orcid.org/0000-0002-7622-4815","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028995727","display_name":"Ali Pezeshki","orcid":"https://orcid.org/0000-0002-7142-5685"},"institutions":[{"id":"https://openalex.org/I92446798","display_name":"Colorado State University","ror":"https://ror.org/03k1gpj17","country_code":"US","type":"education","lineage":["https://openalex.org/I92446798"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ali Pezeshki","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA"],"raw_orcid":"https://orcid.org/0000-0002-7142-5685","affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Colorado State University, Fort Collins, CO, USA","institution_ids":["https://openalex.org/I92446798"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I92446798"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.15538706,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"71","issue":"4","first_page":"2305","last_page":"2315"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9965000152587891,"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"}},"topics":[{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9965000152587891,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.974399983882904,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9397000074386597,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.8903999924659729},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.6830999851226807},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.6179999709129333},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6018000245094299},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5676000118255615},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.5575000047683716},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.4587000012397766},{"id":"https://openalex.org/keywords/set-function","display_name":"Set function","score":0.4332999885082245}],"concepts":[{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.8903999924659729},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7214999794960022},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.6830999851226807},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.6179999709129333},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6018000245094299},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5676000118255615},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.5575000047683716},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.4587000012397766},{"id":"https://openalex.org/C15312841","wikidata":"https://www.wikidata.org/wiki/Q1657198","display_name":"Set function","level":3,"score":0.4332999885082245},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42809998989105225},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4059000015258789},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.40220001339912415},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.400299996137619},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3937000036239624},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.3165999948978424},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.27810001373291016},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.2736000120639801},{"id":"https://openalex.org/C93693863","wikidata":"https://www.wikidata.org/wiki/Q897659","display_name":"Branch and bound","level":2,"score":0.2718999981880188},{"id":"https://openalex.org/C2779044140","wikidata":"https://www.wikidata.org/wiki/Q3274096","display_name":"Utility maximization problem","level":3,"score":0.2614000141620636},{"id":"https://openalex.org/C72169020","wikidata":"https://www.wikidata.org/wiki/Q194404","display_name":"Monotonic function","level":2,"score":0.258899986743927},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.2565000057220459},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.2531999945640564},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.25130000710487366}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tac.2025.3626265","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tac.2025.3626265","pdf_url":null,"source":{"id":"https://openalex.org/S184954342","display_name":"IEEE Transactions on Automatic Control","issn_l":"0018-9286","issn":["0018-9286","1558-2523","2334-3303"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automatic Control","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G180343521","display_name":null,"funder_award_id":"FA8750-20-2-0504","funder_id":"https://openalex.org/F4320338279","funder_display_name":"Air Force Office of Scientific Research"}],"funders":[{"id":"https://openalex.org/F4320338279","display_name":"Air Force Office of Scientific Research","ror":"https://ror.org/011e9bt93"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,50,95,128],"present":[1],"a":[2,62,72,78,87,110,157,163],"simple":[3],"performance":[4,39],"bound":[5,83,100,117,139],"for":[6,36],"the":[7,17,38,41,115,121],"greedy":[8,20,42],"scheme":[9,43],"in":[10,44,61,123],"string":[11,58,93,149],"optimization":[12,59],"problems.":[13],"Our":[14],"approach":[15],"generalizes":[16],"family":[18],"of":[19,40,54,90,105],"curvature":[21],"bounds":[22,33,56,107],"established":[23],"by":[24],"Conforti":[25,124],"and":[26,80,108,125,148],"Cornuejols":[27,126],"(1984).":[28,127],"Specifically,":[29],"we":[30,76,136],"examine":[31],"three":[32],"they":[34],"introduced":[35],"evaluating":[37],"maximizing":[45,66],"monotone":[46,67,146,164],"submodular":[47,68,150],"set":[48,69,147],"functions.":[49,152],"first":[51],"generalize":[52],"two":[53,104,133],"these":[55],"to":[57,86,103,112,140],"problems":[60,143],"manner":[63],"that":[64,84,98,114],"includes":[65],"functions":[70,91],"as":[71],"special":[73],"case.":[74],"Next,":[75],"derive":[77],"simpler":[79],"more":[81],"computable":[82],"applies":[85],"broader":[88],"class":[89],"with":[92,144],"domains.":[94],"then":[96],"prove":[97],"our":[99,130,138],"is":[101,118,156],"superior":[102],"their":[106],"provide":[109],"counterexample":[111],"show":[113],"third":[116],"incorrect":[119],"under":[120],"assumptions":[122],"demonstrate":[129],"results":[131],"through":[132],"applications.":[134],"First,":[135],"apply":[137],"sensor":[141],"coverage":[142],"both":[145],"objective":[151],"The":[153],"second":[154],"application":[155],"social":[158],"welfare":[159],"maximization":[160],"problem":[161],"involving":[162],"non-submodular":[165],"black-box":[166],"utility":[167],"function.":[168]},"counts_by_year":[],"updated_date":"2026-03-31T06:02:25.137627","created_date":"2025-10-28T00:00:00"}