{"id":"https://openalex.org/W2058632122","doi":"https://doi.org/10.1145/1868237.1868250","title":"How to probe for an extreme value","display_name":"How to probe for an extreme value","publication_year":2010,"publication_date":"2010-11-01","ids":{"openalex":"https://openalex.org/W2058632122","doi":"https://doi.org/10.1145/1868237.1868250","mag":"2058632122"},"language":"en","primary_location":{"id":"doi:10.1145/1868237.1868250","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1868237.1868250","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","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/A5101748190","display_name":"Ashish Goel","orcid":"https://orcid.org/0000-0003-0938-0401"},"institutions":[{"id":"https://openalex.org/I97018004","display_name":"Stanford University","ror":"https://ror.org/00f54p054","country_code":"US","type":"education","lineage":["https://openalex.org/I97018004"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ashish Goel","raw_affiliation_strings":["Stanford University, Stanford, CA"],"affiliations":[{"raw_affiliation_string":"Stanford University, Stanford, CA","institution_ids":["https://openalex.org/I97018004"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114008024","display_name":"Sudipto Guha","orcid":null},"institutions":[{"id":"https://openalex.org/I36788626","display_name":"California University of Pennsylvania","ror":"https://ror.org/01spssf70","country_code":"US","type":"education","lineage":["https://openalex.org/I36788626"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sudipto Guha","raw_affiliation_strings":["University of Pennsylvania","#N# * University of Pennsylvania"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania","institution_ids":["https://openalex.org/I36788626"]},{"raw_affiliation_string":"#N# * University of Pennsylvania","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047351951","display_name":"Kamesh Munagala","orcid":"https://orcid.org/0000-0003-2636-9650"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kamesh Munagala","raw_affiliation_strings":["Duke University, Durham, NC"],"affiliations":[{"raw_affiliation_string":"Duke University, Durham, NC","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101748190"],"corresponding_institution_ids":["https://openalex.org/I97018004"],"apc_list":null,"apc_paid":null,"fwci":1.3965,"has_fulltext":false,"cited_by_count":28,"citation_normalized_percentile":{"value":0.84907245,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"7","issue":"1","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9983999729156494,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9983999729156494,"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/T12288","display_name":"Optimization and Search Problems","score":0.9983000159263611,"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.9957000017166138,"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/mathematical-optimization","display_name":"Mathematical optimization","score":0.6805219054222107},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6371716856956482},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5521803498268127},{"id":"https://openalex.org/keywords/observable","display_name":"Observable","score":0.5243311524391174},{"id":"https://openalex.org/keywords/modularity","display_name":"Modularity (biology)","score":0.5105834603309631},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4947027862071991},{"id":"https://openalex.org/keywords/extreme-value-theory","display_name":"Extreme value theory","score":0.4914058446884155},{"id":"https://openalex.org/keywords/term","display_name":"Term (time)","score":0.47447019815444946},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4626603424549103},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.447679340839386},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.44473573565483093},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3072993755340576}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6805219054222107},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6371716856956482},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5521803498268127},{"id":"https://openalex.org/C32848918","wikidata":"https://www.wikidata.org/wiki/Q845789","display_name":"Observable","level":2,"score":0.5243311524391174},{"id":"https://openalex.org/C2779478453","wikidata":"https://www.wikidata.org/wiki/Q6889748","display_name":"Modularity (biology)","level":2,"score":0.5105834603309631},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4947027862071991},{"id":"https://openalex.org/C147581598","wikidata":"https://www.wikidata.org/wiki/Q729429","display_name":"Extreme value theory","level":2,"score":0.4914058446884155},{"id":"https://openalex.org/C61797465","wikidata":"https://www.wikidata.org/wiki/Q1188986","display_name":"Term (time)","level":2,"score":0.47447019815444946},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4626603424549103},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.447679340839386},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.44473573565483093},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3072993755340576},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1868237.1868250","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1868237.1868250","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"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":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.145.7290","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.7290","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cis.upenn.edu/~sudipto/mypapers/minimum.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.413.4450","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.413.4450","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~kamesh/pods06_model.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.85.5550","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.85.5550","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.duke.edu/~kamesh/pods06_model.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5799999833106995,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[{"id":"https://openalex.org/G8095836194","display_name":null,"funder_award_id":"CCF-0430376","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"},{"id":"https://openalex.org/G8937942678","display_name":null,"funder_award_id":"CNS 0540347","funder_id":"https://openalex.org/F4320337388","funder_display_name":"Division of Computer and Network Systems"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"},{"id":"https://openalex.org/F4320337388","display_name":"Division of Computer and Network Systems","ror":"https://ror.org/02rdzmk74"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W1486950299","https://openalex.org/W1530120774","https://openalex.org/W1615155147","https://openalex.org/W1680189815","https://openalex.org/W1825072153","https://openalex.org/W1966156872","https://openalex.org/W1971849893","https://openalex.org/W1973833593","https://openalex.org/W1981673685","https://openalex.org/W1984628625","https://openalex.org/W1999689297","https://openalex.org/W2001729421","https://openalex.org/W2002285507","https://openalex.org/W2026966899","https://openalex.org/W2035463408","https://openalex.org/W2041025394","https://openalex.org/W2044081853","https://openalex.org/W2068637807","https://openalex.org/W2097995023","https://openalex.org/W2102132526","https://openalex.org/W2103440894","https://openalex.org/W2105088727","https://openalex.org/W2109533535","https://openalex.org/W2117399775","https://openalex.org/W2130519052","https://openalex.org/W2131552728","https://openalex.org/W2138064798","https://openalex.org/W2143452574","https://openalex.org/W2156307401","https://openalex.org/W2156632255","https://openalex.org/W2203361072","https://openalex.org/W2611552572","https://openalex.org/W2616376319","https://openalex.org/W4233762723","https://openalex.org/W4255005259","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W1994680671"],"abstract_inverted_index":{"In":[0,54,90,105],"several":[1],"systems":[2],"applications,":[3],"parameters":[4,60],"such":[5,40,98],"as":[6,20,41],"load":[7],"are":[8,143],"known":[9],"only":[10],"with":[11,133],"some":[12],"associated":[13],"uncertainty,":[14],"which":[15,59],"is":[16,127],"specified,":[17],"or":[18,43,47],"modeled,":[19],"a":[21,55,80],"distribution":[22],"over":[23],"values.":[24],"The":[25,137],"performance":[26,71,135,141],"of":[27,51,79,97,111,119,139],"the":[28,49,68,76,95,109,113,117,140],"system":[29,70],"optimization":[30,88],"and":[31,129,148],"monitoring":[32],"schemes":[33],"can":[34],"be":[35],"improved":[36],"by":[37],"spending":[38],"resources":[39],"time":[42],"bandwidth":[44],"in":[45,63,73,116],"observing":[46],"resolving":[48],"values":[50],"these":[52],"parameters.":[53],"resource-constrained":[56],"situation,":[57],"deciding":[58],"to":[61,65,150],"observe":[62],"order":[64],"best":[66],"optimize":[67,75],"expected":[69,77],"(or":[72],"general,":[74],"value":[78,115],"certain":[81],"objective":[82],"function)":[83],"itself":[84],"becomes":[85],"an":[86],"interesting":[87],"problem.":[89],"this":[91,125],"article,":[92],"we":[93,101,107],"initiate":[94],"study":[96,108],"problems":[99],"that":[100,124],"term":[102],"\u201cmodel-driven":[103],"optimization\u201d.":[104],"particular,":[106],"problem":[110,126],"optimizing":[112],"minimum":[114],"presence":[118],"observable":[120],"distributions.":[121],"We":[122],"show":[123],"NP-Hard,":[128],"present":[130],"greedy":[131],"algorithms":[132],"good":[134],"bounds.":[136],"proof":[138],"bounds":[142],"via":[144],"novel":[145],"sub-modularity":[146],"arguments":[147],"connections":[149],"covering":[151],"integer":[152],"programs.":[153]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}