{"id":"https://openalex.org/W2151669659","doi":"https://doi.org/10.1007/s00453-009-9385-1","title":"A Stronger Model of Dynamic Programming Algorithms","display_name":"A Stronger Model of Dynamic Programming Algorithms","publication_year":2010,"publication_date":"2010-01-05","ids":{"openalex":"https://openalex.org/W2151669659","doi":"https://doi.org/10.1007/s00453-009-9385-1","mag":"2151669659"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-009-9385-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-009-9385-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-009-9385-1.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/s00453-009-9385-1.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111965869","display_name":"Joshua Buresh-Oppenheim","orcid":null},"institutions":[{"id":"https://openalex.org/I10734018","display_name":"Akamai (United States)","ror":"https://ror.org/03tarb191","country_code":"US","type":"company","lineage":["https://openalex.org/I10734018"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Joshua Buresh-Oppenheim","raw_affiliation_strings":["Akamai Technologies, Cambridge, USA"],"affiliations":[{"raw_affiliation_string":"Akamai Technologies, Cambridge, USA","institution_ids":["https://openalex.org/I10734018"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5091281372","display_name":"Sashka Davis","orcid":null},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sashka Davis","raw_affiliation_strings":["University of California, San Diego, USA"],"affiliations":[{"raw_affiliation_string":"University of California, San Diego, USA","institution_ids":["https://openalex.org/I36258959"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002208831","display_name":"Russell Impagliazzo","orcid":"https://orcid.org/0000-0003-3236-9796"},"institutions":[{"id":"https://openalex.org/I36258959","display_name":"University of California, San Diego","ror":"https://ror.org/0168r3w48","country_code":"US","type":"education","lineage":["https://openalex.org/I36258959"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Russell Impagliazzo","raw_affiliation_strings":["University of California, San Diego, USA"],"affiliations":[{"raw_affiliation_string":"University of California, San Diego, USA","institution_ids":["https://openalex.org/I36258959"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5111965869"],"corresponding_institution_ids":["https://openalex.org/I10734018"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":{"value":2290,"currency":"EUR","value_usd":2890},"fwci":1.8627,"has_fulltext":true,"cited_by_count":13,"citation_normalized_percentile":{"value":0.87251512,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"60","issue":"4","first_page":"938","last_page":"968"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9995999932289124,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6138300895690918},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.6033278107643127},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6026493310928345},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5339697003364563},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.4685315489768982},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.44451838731765747},{"id":"https://openalex.org/keywords/backtracking","display_name":"Backtracking","score":0.4363260269165039},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.38369813561439514},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.32366061210632324},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27106380462646484}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6138300895690918},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.6033278107643127},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6026493310928345},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5339697003364563},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.4685315489768982},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.44451838731765747},{"id":"https://openalex.org/C156884757","wikidata":"https://www.wikidata.org/wiki/Q798554","display_name":"Backtracking","level":2,"score":0.4363260269165039},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.38369813561439514},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.32366061210632324},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27106380462646484},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00453-009-9385-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-009-9385-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-009-9385-1.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1007/s00453-009-9385-1","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s00453-009-9385-1","pdf_url":"https://link.springer.com/content/pdf/10.1007/s00453-009-9385-1.pdf","source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2309623755","display_name":"ITR: Cryptography: from user needs to protocol design","funder_award_id":"0313241","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G7946014804","display_name":"Duality between Complexity and Algorithms","funder_award_id":"0515332","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2151669659.pdf","grobid_xml":"https://content.openalex.org/works/W2151669659.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W1587123489","https://openalex.org/W1970290925","https://openalex.org/W1984503189","https://openalex.org/W1992649763","https://openalex.org/W2036153837","https://openalex.org/W2048586177","https://openalex.org/W2064383412","https://openalex.org/W2071232852","https://openalex.org/W2073025989","https://openalex.org/W2076776753","https://openalex.org/W2101017768","https://openalex.org/W2108350607","https://openalex.org/W2110342574","https://openalex.org/W2130407580","https://openalex.org/W2132274124","https://openalex.org/W2136658137","https://openalex.org/W2146823188","https://openalex.org/W2151077859","https://openalex.org/W2159579504","https://openalex.org/W2946046356","https://openalex.org/W3136693265","https://openalex.org/W3145128584","https://openalex.org/W3184314314"],"related_works":["https://openalex.org/W2760348722","https://openalex.org/W2783885583","https://openalex.org/W2120095724","https://openalex.org/W2368326437","https://openalex.org/W1631221657","https://openalex.org/W2357479099","https://openalex.org/W2364309619","https://openalex.org/W1525406239","https://openalex.org/W2005965064","https://openalex.org/W1973015798"],"abstract_inverted_index":{"We":[0],"define":[1],"a":[2,19,41,97],"formal":[3],"model":[4,17,24,47,129,142,162],"of":[5,21,25,43,48,54,58,69,86,121,124],"dynamic":[6,78,106,203],"programming":[7,79,196,204],"algorithms":[8,46,70,191],"which":[9,37,150],"we":[10,112],"call":[11],"Prioritized":[12],"Branching":[13],"Programs":[14],"(pBP).":[15],"Our":[16],"is":[18,38,61,143,151],"generalization":[20,42],"the":[22,44,55,94,110,134,146,154],"BT":[23,135,147],"Alekhnovich":[26],"et":[27],"al.":[28],"(IEEE":[29],"Conference":[30],"on":[31],"Computational":[32],"Complexity,":[33],"pp.":[34],"308\u2013322,":[35],"2005),":[36],"in":[39,139,175],"turn":[40],"priority":[45],"Borodin,":[49],"Nielson":[50],"and":[51,192],"Rackoff.":[52],"One":[53],"distinguishing":[56],"features":[57],"these":[59],"models":[60],"that":[62,96,118,138,160,168,179,183,197],"they":[63,82,90],"not":[64],"only":[65],"capture":[66],"large":[67],"classes":[68],"generally":[71],"considered":[72],"to":[73,93],"be":[74,103,131,172,185,199],"greedy,":[75],"backtracking":[76],"or":[77,101],"algorithms,":[80],"but":[81],"also":[83],"allow":[84],"characterizations":[85],"their":[87],"limitations.":[88],"Hence":[89],"give":[91],"meaning":[92],"statement":[95],"given":[98],"problem":[99],"can":[100,130,184],"cannot":[102,171,198],"solved":[104,186,200],"by":[105,133,153,188,193,201],"programming.":[107],"After":[108],"defining":[109],"model,":[111],"prove":[113],"three":[114],"main":[115],"results:":[116],"(i)":[117],"certain":[119],"types":[120],"natural":[122,202],"restrictions":[123],"our":[125,141,161],"seemingly":[126],"more":[127],"powerful":[128],"simulated":[132],"model;":[136],"(ii)":[137],"general":[140],"stronger":[144],"than":[145],"model\u2014a":[148],"fact":[149],"witnessed":[152],"classical":[155],"shortest":[156],"paths":[157],"problem;":[158],"(iii)":[159],"has":[163],"very":[164],"real":[165],"limitations,":[166],"namely":[167],"bipartite":[169],"matching":[170],"efficiently":[173,187],"computed":[174],"it,":[176],"hence":[177],"suggesting":[178],"there":[180],"are":[181],"problems":[182],"network":[189],"flow":[190],"simple":[194],"linear":[195],"approaches.":[205]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}