{"id":"https://openalex.org/W2223195890","doi":"https://doi.org/10.1109/cdc.2015.7402826","title":"Bounding the greedy strategy in finite-horizon string optimization","display_name":"Bounding the greedy strategy in finite-horizon string optimization","publication_year":2015,"publication_date":"2015-12-01","ids":{"openalex":"https://openalex.org/W2223195890","doi":"https://doi.org/10.1109/cdc.2015.7402826","mag":"2223195890"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2015.7402826","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2015.7402826","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 54th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1503.07511","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Yajing Liu","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":"Yajing Liu","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Colorado State University, CO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Colorado State University, CO, USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Edwin K. P. Chong","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":"Edwin K. P. Chong","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Colorado State University, CO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Colorado State University, CO, USA","institution_ids":["https://openalex.org/I92446798"]}]},{"author_position":"last","author":{"id":null,"display_name":"Ali Pezeshki","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":"Ali Pezeshki","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Colorado State University, CO, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Colorado State University, CO, USA","institution_ids":["https://openalex.org/I92446798"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.0903,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.80621664,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"23","issue":null,"first_page":"3900","last_page":"3905"},"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.9997000098228455,"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.9997000098228455,"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.9986000061035156,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9973999857902527,"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/bounding-overwatch","display_name":"Bounding overwatch","score":0.7718999981880188},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.7418000102043152},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.57669997215271},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5649999976158142},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4952999949455261},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.48249998688697815}],"concepts":[{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.7718999981880188},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.7418000102043152},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6385999917984009},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.57669997215271},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5649999976158142},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5472999811172485},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4952999949455261},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.48249998688697815},{"id":"https://openalex.org/C195065555","wikidata":"https://www.wikidata.org/wiki/Q214881","display_name":"Curvature","level":2,"score":0.35679998993873596},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.3544999957084656},{"id":"https://openalex.org/C28761237","wikidata":"https://www.wikidata.org/wiki/Q7805321","display_name":"Time horizon","level":2,"score":0.33899998664855957},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29600000381469727},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.2939999997615814},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.289900004863739},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.28929999470710754},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2800000011920929}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/cdc.2015.7402826","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2015.7402826","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 54th IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:1503.07511","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1503.07511","pdf_url":"https://arxiv.org/pdf/1503.07511","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1503.07511","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1503.07511","pdf_url":"https://arxiv.org/pdf/1503.07511","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1680189815","https://openalex.org/W2011193572","https://openalex.org/W2023351415","https://openalex.org/W2092765469","https://openalex.org/W2132651631","https://openalex.org/W2310530842","https://openalex.org/W2487144912","https://openalex.org/W2757107770","https://openalex.org/W6642747806","https://openalex.org/W6678314445","https://openalex.org/W6785670422"],"related_works":[],"abstract_inverted_index":{"We":[0,122],"consider":[1],"an":[2,21,97],"optimization":[3,64],"problem":[4],"where":[5,60],"the":[6,25,28,41,63,70,102,112],"decision":[7],"variable":[8],"is":[9,62],"a":[10,48,87],"string":[11],"of":[12,27,50,72,89,114],"bounded":[13,46],"length.":[14,66],"For":[15],"some":[16],"time":[17],"there":[18],"has":[19],"been":[20],"interest":[22],"in":[23,133,137],"bounding":[24],"performance":[26],"greedy":[29,42],"strategy":[30,43],"for":[31,40,80],"this":[32,81],"problem.":[33],"Here,":[34],"we":[35,68,95,110],"provide":[36,127],"weakened":[37],"sufficient":[38,79],"conditions":[39,129],"to":[44,83],"be":[45],"by":[47,117],"factor":[49,103],"(1":[51,53],"\u2212":[52,54],"1/K)":[55],"<sup":[56,105],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[57,106],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">K</sup>":[58],"),":[59],"K":[61],"horizon":[65],"Specifically,":[67],"introduce":[69],"notions":[71],"K-submodularity":[73],"and":[74],"K-GO-concavity,":[75],"which":[76],"together":[77],"are":[78],"bound":[82,100],"hold.":[84],"By":[85],"introducing":[86],"notion":[88],"curvature":[90],"\u03b7":[91],"\u2208":[92],"(0;":[93],"1),":[94],"prove":[96],"even":[98],"tighter":[99],"with":[101],"(1/\u03b7)(1\u2212e":[104],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">\u2212\u03b7</sup>":[107],").":[108],"Finally,":[109],"illustrate":[111],"strength":[113],"our":[115,125],"results":[116,126],"considering":[118],"two":[119],"example":[120],"applications.":[121],"show":[123],"that":[124],"weaker":[128],"on":[130],"parameter":[131],"values":[132],"these":[134],"applications":[135],"than":[136],"previous":[138],"results.":[139]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2016-06-24T00:00:00"}