{"id":"https://openalex.org/W2117909275","doi":"https://doi.org/10.1145/1536414.1536431","title":"A nearly optimal oracle for avoiding failed vertices and edges","display_name":"A nearly optimal oracle for avoiding failed vertices and edges","publication_year":2009,"publication_date":"2009-05-31","ids":{"openalex":"https://openalex.org/W2117909275","doi":"https://doi.org/10.1145/1536414.1536431","mag":"2117909275"},"language":"en","primary_location":{"id":"doi:10.1145/1536414.1536431","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/51821","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5033889707","display_name":"Aaron Bernstein","orcid":null},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Aaron Bernstein","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028448267","display_name":"David R. Karger","orcid":"https://orcid.org/0000-0002-0024-5847"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David Karger","raw_affiliation_strings":["Massachusetts Institute of Technology, Cambridge, MA, USA","Massachusetts Institute of Technology; ,; Cambridge MA USA"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology, Cambridge, MA, USA","institution_ids":["https://openalex.org/I63966007"]},{"raw_affiliation_string":"Massachusetts Institute of Technology; ,; Cambridge MA USA","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5033889707"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":6.3426,"has_fulltext":false,"cited_by_count":100,"citation_normalized_percentile":{"value":0.96895983,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"101","last_page":"110"},"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.9998000264167786,"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.9998000264167786,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9991000294685364,"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.9990000128746033,"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/oracle","display_name":"Oracle","score":0.8775553107261658},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.709457278251648},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6954792141914368},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6550444960594177},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5764481425285339},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5299668908119202},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.49607810378074646},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4707030951976776},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.4537390470504761},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.42196837067604065},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4185049831867218},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34063318371772766}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.8775553107261658},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.709457278251648},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6954792141914368},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6550444960594177},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5764481425285339},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5299668908119202},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.49607810378074646},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4707030951976776},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.4537390470504761},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.42196837067604065},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4185049831867218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34063318371772766},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/1536414.1536431","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1536414.1536431","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-first annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.208.1118","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.208.1118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://theory.csail.mit.edu/%7Ekarger/Papers/optimalDistanceOracle.pdf","raw_type":"text"},{"id":"pmh:oai:alma.01RUT_INST:11665194240004646","is_oa":false,"landing_page_url":"https://scholarship.libraries.rutgers.edu/esploro/outputs/conferenceProceeding/A-nearly-optimal-oracle-for-avoiding/991031666275804646","pdf_url":null,"source":{"id":"https://openalex.org/S4210197018","display_name":"View","issn_l":"2688-268X","issn":["2688-268X","2688-3988"],"is_oa":false,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Conference Proceedings"},{"id":"pmh:oai:dspace.mit.edu:1721.1/51821","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/51821","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"David Karger","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/51821","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/51821","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"David Karger","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W56894902","https://openalex.org/W1554407673","https://openalex.org/W1773616669","https://openalex.org/W1947899203","https://openalex.org/W1989169588","https://openalex.org/W1999293689","https://openalex.org/W2011999472","https://openalex.org/W2092901467","https://openalex.org/W2110004664","https://openalex.org/W2121601357","https://openalex.org/W2134729426","https://openalex.org/W2139610344","https://openalex.org/W2169528473","https://openalex.org/W4389615669"],"related_works":["https://openalex.org/W4367665025","https://openalex.org/W2036758175","https://openalex.org/W3046990805","https://openalex.org/W4287691960","https://openalex.org/W1994598067","https://openalex.org/W3097369619","https://openalex.org/W2061496873","https://openalex.org/W2011106535","https://openalex.org/W2963622642","https://openalex.org/W4300613227"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,59,66,71,96,103],"improved":[3,104,150],"oracle":[4,60,88,160],"for":[5,133],"the":[6,29,33,36,125,134,153],"distance":[7],"sensitivity":[8],"problem.":[9],"The":[10,54],"goal":[11],"is":[12,32,111,123,161],"to":[13,25,41,130,152,164],"preprocess":[14],"a":[15,77,91,144],"directed":[16,146],"graph":[17],"G":[18],"=":[19],"(V,E)":[20],"with":[21,84],"non-negative":[22],"edge":[23,52],"weights":[24],"answer":[26],"queries":[27],"of":[28,35,61,107,137],"form:":[30],"what":[31],"length":[34],"shortest":[37,141,156],"path":[38,157],"from":[39],"x":[40],"y":[42],"that":[43,64,82,114],"does":[44],"not":[45],"go":[46],"through":[47],"some":[48],"failed":[49],"vertex":[50],"or":[51],"f.":[53],"previous":[55],"best":[56,126],"algorithm":[57,81],"produces":[58],"size":[62],"~O(n2)":[63,97],"has":[65,90,102],"O(1)":[67,115],"query":[68,93],"time,":[69],"and":[70,95,109,119],"~O(n2\u221am)":[72],"construction":[73,105,121],"time.":[74],"It":[75],"was":[76],"randomized":[78],"Monte":[79],"Carlo":[80],"worked":[83],"high":[85],"probability.":[86],"Our":[87],"also":[89,124],"constant":[92],"time":[94,106,122],"space":[98],"requirement,":[99],"but":[100],"it":[101,110],"~O(mn),":[108],"deterministic.":[112],"Note":[113],"query,":[116],"O(n2)":[117],"space,":[118],"O(mn)":[120],"known":[127],"bound":[128],"(up":[129],"logarithmic":[131,165],"factors)":[132],"simpler":[135],"problem":[136],"finding":[138],"all":[139,154],"pairs":[140,155],"paths":[142],"in":[143],"weighted,":[145],"graph.":[147],"Thus,":[148],"barring":[149],"solutions":[151],"problem,":[158],"our":[159],"optimal":[162],"up":[163],"factors.":[166]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":6},{"year":2020,"cited_by_count":9},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":6},{"year":2016,"cited_by_count":7},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":6}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}