{"id":"https://openalex.org/W2039219233","doi":"https://doi.org/10.1137/080724514","title":"Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems","display_name":"Small Approximate Pareto Sets for Biobjective Shortest Paths and Other Problems","publication_year":2009,"publication_date":"2009-10-16","ids":{"openalex":"https://openalex.org/W2039219233","doi":"https://doi.org/10.1137/080724514","mag":"2039219233"},"language":"en","primary_location":{"id":"doi:10.1137/080724514","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080724514","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5054966819","display_name":"Ilias Diakonikolas","orcid":"https://orcid.org/0000-0002-5486-1856"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ilias Diakonikolas","raw_affiliation_strings":["ilias@cs.columbia.edu and mihalis@cs.columbia.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"ilias@cs.columbia.edu and mihalis@cs.columbia.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043084405","display_name":"Mihalis Yannakakis","orcid":"https://orcid.org/0000-0003-2857-1860"},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mihalis Yannakakis","raw_affiliation_strings":["Department of Computer Science; Columbia University; New York NY 10027"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science; Columbia University; New York NY 10027","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5054966819"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.1417,"has_fulltext":false,"cited_by_count":66,"citation_normalized_percentile":{"value":0.95783036,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"39","issue":"4","first_page":"1340","last_page":"1371"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","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/T12072","display_name":"Machine Learning and Algorithms","score":0.9959999918937683,"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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/pareto-principle","display_name":"Pareto principle","score":0.6692185401916504},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6136494874954224},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5393673181533813},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5220755934715271},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5022807121276855},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4950060248374939},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4532601833343506},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4527941942214966},{"id":"https://openalex.org/keywords/multi-objective-optimization","display_name":"Multi-objective optimization","score":0.42587196826934814},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.41529572010040283},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2862900495529175},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.15439918637275696}],"concepts":[{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.6692185401916504},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6136494874954224},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5393673181533813},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5220755934715271},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5022807121276855},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4950060248374939},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4532601833343506},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4527941942214966},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.42587196826934814},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.41529572010040283},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2862900495529175},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.15439918637275696},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/080724514","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080724514","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":50,"referenced_works":["https://openalex.org/W119169328","https://openalex.org/W173895910","https://openalex.org/W1501120368","https://openalex.org/W1503497657","https://openalex.org/W1576317141","https://openalex.org/W1813291595","https://openalex.org/W1852354434","https://openalex.org/W1928381443","https://openalex.org/W1966395945","https://openalex.org/W1979253499","https://openalex.org/W1980307941","https://openalex.org/W1984385885","https://openalex.org/W1998631486","https://openalex.org/W1999396007","https://openalex.org/W2003806381","https://openalex.org/W2006742819","https://openalex.org/W2008499862","https://openalex.org/W2013195123","https://openalex.org/W2022258268","https://openalex.org/W2022671649","https://openalex.org/W2026427926","https://openalex.org/W2033248211","https://openalex.org/W2040924621","https://openalex.org/W2046225382","https://openalex.org/W2054459484","https://openalex.org/W2058787216","https://openalex.org/W2059453880","https://openalex.org/W2060882019","https://openalex.org/W2061701207","https://openalex.org/W2064561047","https://openalex.org/W2066047491","https://openalex.org/W2074117023","https://openalex.org/W2083743691","https://openalex.org/W2097509673","https://openalex.org/W2120005825","https://openalex.org/W2122775389","https://openalex.org/W2129143099","https://openalex.org/W2130626677","https://openalex.org/W2139298384","https://openalex.org/W2143109153","https://openalex.org/W2143996311","https://openalex.org/W2157054705","https://openalex.org/W2157993733","https://openalex.org/W2163322487","https://openalex.org/W2164845984","https://openalex.org/W2330274477","https://openalex.org/W2993416013","https://openalex.org/W4238284510","https://openalex.org/W4255776112","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2090178682","https://openalex.org/W2001591765","https://openalex.org/W4241467429","https://openalex.org/W2073147994","https://openalex.org/W1588199609","https://openalex.org/W2384474142","https://openalex.org/W3083133203","https://openalex.org/W1550055091","https://openalex.org/W2744462909","https://openalex.org/W1971520370"],"abstract_inverted_index":{"We":[0,26,93],"investigate":[1],"the":[2,18,70,77,108,125],"problem":[3,110],"of":[4,9,21,33,79,111,117],"computing":[5,112],"a":[6,14,22,30,113,121],"minimum":[7,71],"set":[8,60],"solutions":[10,68,118],"that":[11,28,61,76],"approximates":[12],"within":[13],"specified":[15,114],"accuracy":[16],"$\\epsilon$":[17],"Pareto":[19,126],"curve":[20],"multiobjective":[23],"optimization":[24],"problem.":[25],"show":[27,75],"for":[29,83,99,107],"broad":[31],"class":[32],"biobjective":[34],"problems":[35,41],"(containing":[36],"many":[37,50,67],"important":[38],"widely":[39],"studied":[40],"such":[42],"as":[43,66,69,104,106],"shortest":[44],"paths,":[45],"spanning":[46],"tree,":[47],"matching,":[48],"and":[49,96],"others),":[51],"we":[52,74],"can":[53],"compute":[54],"in":[55],"polynomial":[56],"time":[57],"an":[58],"$\\epsilon$-Pareto":[59],"contains":[62],"at":[63],"most":[64],"twice":[65],"set.":[72],"Furthermore":[73],"factor":[78],"2":[80],"is":[81,88],"tight":[82],"these":[84],"problems;":[85],"i.e.,":[86],"it":[87],"NP-hard":[89],"to":[90,124],"do":[91],"better.":[92],"present":[94],"upper":[95],"lower":[97],"bounds":[98],"three":[100],"or":[101],"more":[102],"objectives,":[103],"well":[105],"dual":[109],"number":[115],"k":[116],"which":[119],"provide":[120],"good":[122],"approximation":[123],"curve.":[127]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":6},{"year":2022,"cited_by_count":4},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":6},{"year":2013,"cited_by_count":10},{"year":2012,"cited_by_count":6}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}