{"id":"https://openalex.org/W2122967662","doi":"https://doi.org/10.1007/11841036_50","title":"Stochastic Shortest Paths Via Quasi-convex Maximization","display_name":"Stochastic Shortest Paths Via Quasi-convex Maximization","publication_year":2006,"publication_date":"2006-01-01","ids":{"openalex":"https://openalex.org/W2122967662","doi":"https://doi.org/10.1007/11841036_50","mag":"2122967662"},"language":"en","primary_location":{"id":"doi:10.1007/11841036_50","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11841036_50","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","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/A5013808874","display_name":"Evdokia Nikolova","orcid":"https://orcid.org/0000-0002-8801-0320"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]},{"id":"https://openalex.org/I4405258931","display_name":"MIT Computer Science and Artificial Intelligence Laboratory","ror":"https://ror.org/01e85r662","country_code":"US","type":"facility","lineage":["https://openalex.org/I4405258931","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Evdokia Nikolova","raw_affiliation_strings":["MIT CSAIL, MERL, Harvard University, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT CSAIL, MERL, Harvard University, Cambridge, MA","institution_ids":["https://openalex.org/I136199984","https://openalex.org/I4405258931"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022068777","display_name":"Jonathan A. Kelner","orcid":null},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]},{"id":"https://openalex.org/I4405258931","display_name":"MIT Computer Science and Artificial Intelligence Laboratory","ror":"https://ror.org/01e85r662","country_code":"US","type":"facility","lineage":["https://openalex.org/I4405258931","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jonathan A. Kelner","raw_affiliation_strings":["MIT CSAIL, MERL, Harvard University, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT CSAIL, MERL, Harvard University, Cambridge, MA","institution_ids":["https://openalex.org/I136199984","https://openalex.org/I4405258931"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5013617347","display_name":"Matthew Brand","orcid":"https://orcid.org/0000-0001-7698-4884"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]},{"id":"https://openalex.org/I4405258931","display_name":"MIT Computer Science and Artificial Intelligence Laboratory","ror":"https://ror.org/01e85r662","country_code":"US","type":"facility","lineage":["https://openalex.org/I4405258931","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Matthew Brand","raw_affiliation_strings":["MIT CSAIL, MERL, Harvard University, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT CSAIL, MERL, Harvard University, Cambridge, MA","institution_ids":["https://openalex.org/I136199984","https://openalex.org/I4405258931"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5062318856","display_name":"Michael Mitzenmacher","orcid":"https://orcid.org/0000-0001-5430-5457"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]},{"id":"https://openalex.org/I4405258931","display_name":"MIT Computer Science and Artificial Intelligence Laboratory","ror":"https://ror.org/01e85r662","country_code":"US","type":"facility","lineage":["https://openalex.org/I4405258931","https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Michael Mitzenmacher","raw_affiliation_strings":["MIT CSAIL, MERL, Harvard University, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT CSAIL, MERL, Harvard University, Cambridge, MA","institution_ids":["https://openalex.org/I136199984","https://openalex.org/I4405258931"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":3.2905,"has_fulltext":false,"cited_by_count":144,"citation_normalized_percentile":{"value":0.93575335,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"552","last_page":"563"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.9987000226974487,"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.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.6958757638931274},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.5886598229408264},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5057868957519531},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.49336138367652893},{"id":"https://openalex.org/keywords/range","display_name":"Range (aeronautics)","score":0.475791335105896},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4755128026008606},{"id":"https://openalex.org/keywords/parametric-statistics","display_name":"Parametric statistics","score":0.449171781539917},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44723325967788696},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43986764550209045},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4210563600063324},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4150456190109253},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.40606385469436646},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.32974404096603394}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6958757638931274},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.5886598229408264},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5057868957519531},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49336138367652893},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.475791335105896},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4755128026008606},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.449171781539917},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44723325967788696},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43986764550209045},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4210563600063324},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4150456190109253},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.40606385469436646},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.32974404096603394},{"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/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/11841036_50","is_oa":false,"landing_page_url":"https://doi.org/10.1007/11841036_50","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.136.4821","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.136.4821","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/~enikolova/papers/ESA06A_nikolova_final.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.137.7530","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.7530","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.eecs.harvard.edu/~michaelm/postscripts/esa2006c.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.417.3810","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.417.3810","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.merl.com/publications/docs/TR2006-128.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W202383464","https://openalex.org/W1490155155","https://openalex.org/W1558701214","https://openalex.org/W1581520665","https://openalex.org/W1604276976","https://openalex.org/W1825072153","https://openalex.org/W1972886737","https://openalex.org/W1976157781","https://openalex.org/W1992876208","https://openalex.org/W1998062665","https://openalex.org/W2016049811","https://openalex.org/W2039114216","https://openalex.org/W2044081853","https://openalex.org/W2058135791","https://openalex.org/W2079274727","https://openalex.org/W2085400727","https://openalex.org/W2098432798","https://openalex.org/W2114251562","https://openalex.org/W2131552728","https://openalex.org/W2139819161","https://openalex.org/W2146189710","https://openalex.org/W2164845984","https://openalex.org/W2177603603","https://openalex.org/W2301746362","https://openalex.org/W2614653677"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W4293054712","https://openalex.org/W2767202586","https://openalex.org/W2375775343","https://openalex.org/W2388654557","https://openalex.org/W2360981904","https://openalex.org/W2365712669","https://openalex.org/W2161960576","https://openalex.org/W1990043277","https://openalex.org/W2349797546"],"abstract_inverted_index":null,"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":9},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":11},{"year":2018,"cited_by_count":14},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":11},{"year":2015,"cited_by_count":10},{"year":2014,"cited_by_count":10},{"year":2013,"cited_by_count":13},{"year":2012,"cited_by_count":12}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}