{"id":"https://openalex.org/W2031388544","doi":"https://doi.org/10.1145/1970392.1970393","title":"On the competitive ratio of evaluating priced functions","display_name":"On the competitive ratio of evaluating priced functions","publication_year":2011,"publication_date":"2011-05-01","ids":{"openalex":"https://openalex.org/W2031388544","doi":"https://doi.org/10.1145/1970392.1970393","mag":"2031388544"},"language":"en","primary_location":{"id":"doi:10.1145/1970392.1970393","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1970392.1970393","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","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/A5037548562","display_name":"Ferdinando Cicalese","orcid":"https://orcid.org/0000-0003-1652-0599"},"institutions":[{"id":"https://openalex.org/I131729948","display_name":"University of Salerno","ror":"https://ror.org/0192m2k53","country_code":"IT","type":"education","lineage":["https://openalex.org/I131729948"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Ferdinando Cicalese","raw_affiliation_strings":["University of Salerno, Italy","University Of Salerno, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Salerno, Italy","institution_ids":["https://openalex.org/I131729948"]},{"raw_affiliation_string":"University Of Salerno, Italy","institution_ids":["https://openalex.org/I131729948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073527139","display_name":"Eduardo Sany Laber","orcid":"https://orcid.org/0000-0002-9025-8333"},"institutions":[{"id":"https://openalex.org/I2699952","display_name":"Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro","ror":"https://ror.org/01dg47b60","country_code":"BR","type":"education","lineage":["https://openalex.org/I2699952"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Eduardo Sany Laber","raw_affiliation_strings":["PUC-Rio, Brazil","PUC RIO, Brazil"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"PUC-Rio, Brazil","institution_ids":["https://openalex.org/I2699952"]},{"raw_affiliation_string":"PUC RIO, Brazil","institution_ids":["https://openalex.org/I2699952"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.0227,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.93701349,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"58","issue":"3","first_page":"1","last_page":"40"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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.9998000264167786,"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.9994000196456909,"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.9977999925613403,"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/function","display_name":"Function (biology)","score":0.6562085151672363},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.59236079454422},{"id":"https://openalex.org/keywords/value","display_name":"Value (mathematics)","score":0.5784721374511719},{"id":"https://openalex.org/keywords/variable","display_name":"Variable (mathematics)","score":0.5506864190101624},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5253169536590576},{"id":"https://openalex.org/keywords/preemption","display_name":"Preemption","score":0.5176684856414795},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5146952271461487},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.48012733459472656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4775439202785492},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4765791893005371},{"id":"https://openalex.org/keywords/reading","display_name":"Reading (process)","score":0.44946956634521484},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.44067633152008057},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.4393294155597687},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43636542558670044},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3796447515487671},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3760969042778015},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.28148624300956726},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.12760207056999207}],"concepts":[{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.6562085151672363},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.59236079454422},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.5784721374511719},{"id":"https://openalex.org/C182365436","wikidata":"https://www.wikidata.org/wiki/Q50701","display_name":"Variable (mathematics)","level":2,"score":0.5506864190101624},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5253169536590576},{"id":"https://openalex.org/C206952183","wikidata":"https://www.wikidata.org/wiki/Q1193100","display_name":"Preemption","level":2,"score":0.5176684856414795},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5146952271461487},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.48012733459472656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4775439202785492},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4765791893005371},{"id":"https://openalex.org/C554936623","wikidata":"https://www.wikidata.org/wiki/Q199657","display_name":"Reading (process)","level":2,"score":0.44946956634521484},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.44067633152008057},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.4393294155597687},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43636542558670044},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3796447515487671},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3760969042778015},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.28148624300956726},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.12760207056999207},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1970392.1970393","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1970392.1970393","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:pub.librecat.org:2499677","is_oa":false,"landing_page_url":"https://pub.uni-bielefeld.de/record/2499677","pdf_url":null,"source":{"id":"https://openalex.org/S4306401671","display_name":"PUB \u2013 Publications at Bielefeld University (Bielefeld University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I20121455","host_organization_name":"Bielefeld University","host_organization_lineage":["https://openalex.org/I20121455"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cicalese F, Laber E. On the Competitive Ratio of Evaluating Priced Functions. In:  <em>Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006)</em>. 2006: 944-953.","raw_type":"info:eu-repo/semantics/conferenceObject"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Quality Education","score":0.6800000071525574,"id":"https://metadata.un.org/sdg/4"}],"awards":[{"id":"https://openalex.org/G1696854188","display_name":null,"funder_award_id":"E-26/102.192/2009","funder_id":"https://openalex.org/F4320322749","funder_display_name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro"},{"id":"https://openalex.org/G2713890833","display_name":null,"funder_award_id":"305783/2009-2476791/2009-0","funder_id":"https://openalex.org/F4320322025","funder_display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico"}],"funders":[{"id":"https://openalex.org/F4320322025","display_name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","ror":"https://ror.org/03swz6y49"},{"id":"https://openalex.org/F4320322749","display_name":"Funda\u00e7\u00e3o Carlos Chagas Filho de Amparo \u00e0 Pesquisa do Estado do Rio de Janeiro","ror":"https://ror.org/03kk0s825"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W606453859","https://openalex.org/W1486713623","https://openalex.org/W1493342333","https://openalex.org/W1551177187","https://openalex.org/W1574785685","https://openalex.org/W1973833593","https://openalex.org/W1986302927","https://openalex.org/W1987842530","https://openalex.org/W2012329067","https://openalex.org/W2012496360","https://openalex.org/W2026325622","https://openalex.org/W2026501144","https://openalex.org/W2058792175","https://openalex.org/W2060883486","https://openalex.org/W2070053775","https://openalex.org/W2106944855","https://openalex.org/W2115837137","https://openalex.org/W2122244956","https://openalex.org/W2122410182","https://openalex.org/W2123540893","https://openalex.org/W2130519052","https://openalex.org/W2134298805","https://openalex.org/W2137560895","https://openalex.org/W2144592033","https://openalex.org/W2486715098","https://openalex.org/W2561675875","https://openalex.org/W2623507201","https://openalex.org/W6629428243"],"related_works":["https://openalex.org/W2752015945","https://openalex.org/W1881329561","https://openalex.org/W1493790977","https://openalex.org/W2358378335","https://openalex.org/W3135987664","https://openalex.org/W2070352489","https://openalex.org/W1977040436","https://openalex.org/W1996475154","https://openalex.org/W2026356916","https://openalex.org/W2040050870"],"abstract_inverted_index":{"Let":[0],"f":[1,34,57,72,196,200,235],"be":[2,20],"a":[3,6,36,43,120,151,159,162,184,205,227,251,325,377],"function":[4,199,213],"on":[5,161],"set":[7,44,336],"of":[8,23,27,45,56,85,92,126,158,177,224,257,268,289,310,329,337,358,388],"variables":[9,46,128,179,360],"V":[10,16,49,115],".":[11,29,58,116,236],"For":[12,171],"each":[13,112,198,210],"x":[14,28,113],"\u2208":[15,114],",":[17,110,299],"let":[18],"c(x)":[19,109],"the":[21,25,54,67,74,83,86,93,98,103,107,124,127,140,156,165,168,172,175,178,189,217,221,239,244,255,275,294,297,306,315,334,346,353,356,359,372,386],"cost":[22,68,108,166,212],"reading":[24,42,141,150],"value":[26,55],"An":[30],"algorithm":[31,105,187,229,384],"for":[32,38,111,147,197,209,220,260,324,385],"evaluating":[33,261],"is":[35,79,137,167,202,226],"strategy":[37],"adaptively":[39],"identifying":[40],"and":[41,134,164,208],"U":[47],"\u2286":[48],"whose":[50],"values":[51],"uniquely":[52],"determine":[53,304],"We":[59,88,96,117,263,340],"are":[60,129,180,301,361],"interested":[61],"in":[62,73,101,132,139,238,272,281,293],"finding":[63],"algorithms":[64,259,277],"which":[65,102,318,331],"minimize":[66],"incurred":[69],"to":[70,81,274,284,303,320,344,352,370,375,382],"evaluate":[71],"above":[75,94],"sense.":[76],"Competitive":[77],"analysis":[78],"employed":[80],"measure":[82],"performance":[84],"algorithms.":[87],"address":[89],"two":[90],"variants":[91],"problem.":[95],"consider":[97],"basic":[99],"model":[100,122,144,173,354],"evaluation":[104],"knows":[106],"also":[118,332,341],"study":[119],"novel":[121],"where":[123,174,355],"costs":[125,176,357],"not":[130,362],"known":[131,278,363],"advance":[133],"some":[135],"preemption":[136],"allowed":[138],"operations.":[142],"This":[143],"has":[145],"applications,":[146],"example,":[148],"when":[149],"variable":[152],"coincides":[153],"with":[154,188,230,349],"obtaining":[155],"output":[157],"job":[160],"CPU":[163,169],"time.":[170],"known,":[181],"we":[182,242,300,367],"present":[183],"polynomial":[185],"time":[186],"best":[190,276],"possible":[191],"competitive":[192],"ratio":[193],"\u03b3":[194,233],"c":[195,214,234],"that":[201,253,265],"representable":[203,392],"by":[204,393],"threshold":[206,394],"tree":[207],"fixed":[211],"(\u22c5).":[215],"Remarkably,":[216,314],"best-known":[218],"result":[219],"same":[222,240],"class":[223,328,387],"functions":[225,290,391],"pseudo-polynomial":[228],"competitiveness":[231,309],"2":[232],"Still":[237],"model,":[241],"introduce":[243],"Linear":[245],"Programming":[246],"Approach":[247],"(":[248],"LPA":[249,298,347,374],"),":[250],"framework":[252],"allows":[254],"design":[256,376],"efficient":[258],"functions.":[262,313,339],"show":[264,342,368],"different":[266,287],"implementations":[267],"this":[269,321],"approach":[270],"lead":[271],"general":[273],"so":[279],"far\u2014and":[280],"many":[282],"cases":[283],"optimal":[285,307,379],"algorithms\u2014for":[286],"classes":[288],"considered":[291],"before":[292],"literature.":[295],"Via":[296],"able":[302],"exactly":[305],"extremal":[308],"monotone":[311,389],"Boolean":[312,338,390],"upper":[316],"bound":[317],"leads":[319],"result,":[322],"holds":[323],"much":[326],"broader":[327],"functions,":[330],"includes":[333],"whole":[335],"how":[343,369],"extend":[345],"(together":[348],"these":[350],"results)":[351],"beforehand.":[364],"In":[365],"particular,":[366],"employ":[371],"extended":[373],"polynomial-time":[378],"(with":[380],"respect":[381],"competitiveness)":[383],"trees.":[395]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":9}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}