{"id":"https://openalex.org/W3008505995","doi":"https://doi.org/10.1137/18m1196339","title":"Approximation Limitations of Pure Dynamic Programming","display_name":"Approximation Limitations of Pure Dynamic Programming","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3008505995","doi":"https://doi.org/10.1137/18m1196339","mag":"3008505995"},"language":"en","primary_location":{"id":"doi:10.1137/18m1196339","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1196339","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2012.12831","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Stasys Jukna","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Stasys Jukna","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Hannes Seiwert","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hannes Seiwert","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.2536,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.5877106,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"49","issue":"1","first_page":"170","last_page":"205"},"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.5577999949455261,"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.5577999949455261,"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/T11435","display_name":"Polynomial and algebraic computation","score":0.22499999403953552,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.10119999945163727,"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/converse","display_name":"Converse","score":0.7354000210762024},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.6492999792098999},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.5845999717712402},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.573199987411499},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.5443999767303467},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.474700003862381},{"id":"https://openalex.org/keywords/electronic-circuit","display_name":"Electronic circuit","score":0.36480000615119934},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3499999940395355},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.32690000534057617}],"concepts":[{"id":"https://openalex.org/C2776809875","wikidata":"https://www.wikidata.org/wiki/Q1375963","display_name":"Converse","level":2,"score":0.7354000210762024},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.6492999792098999},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.5845999717712402},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.573199987411499},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.5443999767303467},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5070000290870667},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.474700003862381},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.45559999346733093},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.40939998626708984},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36500000953674316},{"id":"https://openalex.org/C134146338","wikidata":"https://www.wikidata.org/wiki/Q1815901","display_name":"Electronic circuit","level":2,"score":0.36480000615119934},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3499999940395355},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.32690000534057617},{"id":"https://openalex.org/C62114133","wikidata":"https://www.wikidata.org/wiki/Q5366944","display_name":"L-reduction","level":5,"score":0.29739999771118164},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.29649999737739563},{"id":"https://openalex.org/C64731005","wikidata":"https://www.wikidata.org/wiki/Q333464","display_name":"Analysis of algorithms","level":2,"score":0.28459998965263367},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2838999927043915},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.27730000019073486},{"id":"https://openalex.org/C2778029271","wikidata":"https://www.wikidata.org/wiki/Q5421931","display_name":"Extension (predicate logic)","level":2,"score":0.27559998631477356},{"id":"https://openalex.org/C90702460","wikidata":"https://www.wikidata.org/wiki/Q1055112","display_name":"Circuit complexity","level":3,"score":0.2736000120639801},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.2660999894142151},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.259799987077713},{"id":"https://openalex.org/C145242015","wikidata":"https://www.wikidata.org/wiki/Q774123","display_name":"Approximation theory","level":2,"score":0.257099986076355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2540999948978424},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.25279998779296875},{"id":"https://openalex.org/C126221529","wikidata":"https://www.wikidata.org/wiki/Q3116070","display_name":"Greedy randomized adaptive search procedure","level":3,"score":0.2517000138759613},{"id":"https://openalex.org/C122383733","wikidata":"https://www.wikidata.org/wiki/Q865920","display_name":"Approximation error","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/18m1196339","is_oa":false,"landing_page_url":"https://doi.org/10.1137/18m1196339","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:2012.12831","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2012.12831","pdf_url":"https://arxiv.org/pdf/2012.12831","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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:2012.12831","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2012.12831","pdf_url":"https://arxiv.org/pdf/2012.12831","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":[{"id":"https://openalex.org/G477691558","display_name":null,"funder_award_id":"JU\u00a03105/1-1","funder_id":"https://openalex.org/F4320320879","funder_display_name":"Deutsche Forschungsgemeinschaft"}],"funders":[{"id":"https://openalex.org/F4320320879","display_name":"Deutsche Forschungsgemeinschaft","ror":"https://ror.org/018mejw64"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W116606405","https://openalex.org/W1969186119","https://openalex.org/W1970105392","https://openalex.org/W1976802094","https://openalex.org/W1991133427","https://openalex.org/W1991528957","https://openalex.org/W1996668544","https://openalex.org/W2011638021","https://openalex.org/W2012476164","https://openalex.org/W2021082954","https://openalex.org/W2033637560","https://openalex.org/W2035655704","https://openalex.org/W2045260280","https://openalex.org/W2057929994","https://openalex.org/W2104734478","https://openalex.org/W2157358149","https://openalex.org/W2227557434","https://openalex.org/W2548334940","https://openalex.org/W2805855356","https://openalex.org/W3139013448"],"related_works":[],"abstract_inverted_index":{"We":[0],"prove":[1],"the":[2,9,37,71,102],"first,":[3],"even":[4],"superpolynomial,":[5],"lower":[6,64],"bounds":[7,65],"on":[8],"size":[10],"of":[11,57,62,74],"tropical":[12,67],"(min,+)":[13],"and":[14,78],"(max,+)":[15],"circuits":[16,48,68],"approximating":[17],"given":[18],"optimization":[19,28],"problems.":[20],"Many":[21],"classical":[22],"dynamic":[23],"programming":[24],"(DP)":[25],"algorithms":[26,77,80,86],"for":[27,54,66],"problems":[29],"are":[30,81],"pure":[31,75,84],"in":[32,43,91,97],"that":[33,70,101],"they":[34],"only":[35],"use":[36],"basic":[38],"$\\min$,":[39],"$\\max$,":[40],"$+$":[41],"operations":[42],"their":[44],"recursion":[45],"equations.":[46],"Tropical":[47],"constitute":[49],"a":[50],"rigorous":[51],"mathematical":[52],"model":[53],"this":[55,98],"class":[56],"algorithms.":[58],"An":[59],"algorithmic":[60],"consequence":[61,99],"our":[63],"is":[69,93,100],"approximation":[72,92],"powers":[73],"DP":[76,85],"greedy":[79,90],"incomparable.":[82],"That":[83],"can":[87],"hardly":[88],"beat":[89],"long":[94],"known.":[95],"New":[96],"converse":[103],"also":[104],"holds.":[105]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2}],"updated_date":"2026-08-01T09:00:35.917206","created_date":"2020-03-06T00:00:00"}