{"id":"https://openalex.org/W2017117017","doi":"https://doi.org/10.1007/s00453-001-0111-x","title":"Computing Approximate Shortest Paths on Convex Polytopes","display_name":"Computing Approximate Shortest Paths on Convex Polytopes","publication_year":2002,"publication_date":"2002-06-01","ids":{"openalex":"https://openalex.org/W2017117017","doi":"https://doi.org/10.1007/s00453-001-0111-x","mag":"2017117017"},"language":"en","primary_location":{"id":"doi:10.1007/s00453-001-0111-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0111-x","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","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/A5058649592","display_name":"Pankaj K. Agarwal","orcid":"https://orcid.org/0000-0002-9439-181X"},"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":true,"raw_author_name":"P. K. Agarwal","raw_affiliation_strings":["Center for Geometric Computing, Department of Computer Science, Box 90129, Duke University, Durham, NC  27708-0129, USA. pankaj@cs.duke.edu., US"],"affiliations":[{"raw_affiliation_string":"Center for Geometric Computing, Department of Computer Science, Box 90129, Duke University, Durham, NC  27708-0129, USA. pankaj@cs.duke.edu., US","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040577923","display_name":"Sariel Har-Peled","orcid":"https://orcid.org/0000-0003-2638-9635"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Har-Peled","raw_affiliation_strings":["Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA. sariel@cs.uiuc.edu., US"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois at Urbana-Champaign, Urbana, IL 61801, USA. sariel@cs.uiuc.edu., US","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5055020833","display_name":"Meetesh Karia","orcid":null},"institutions":[{"id":"https://openalex.org/I4210165926","display_name":"Certis USA (United States)","ror":"https://ror.org/058nb7410","country_code":"US","type":"company","lineage":["https://openalex.org/I4210165926"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. Karia","raw_affiliation_strings":["Trilogy Software, Inc.,  6034 W. Courtyard Drive, Austin, TX 78730, USA. Meetesh_Karia @trilogy.com., US","Trilogy Software, Inc., 6034 W. Courtyard Drive, Austin, TX 78730, USA. Meetesh_Karia @trilogy.com., US#TAB#"],"affiliations":[{"raw_affiliation_string":"Trilogy Software, Inc.,  6034 W. Courtyard Drive, Austin, TX 78730, USA. Meetesh_Karia @trilogy.com., US","institution_ids":["https://openalex.org/I4210165926"]},{"raw_affiliation_string":"Trilogy Software, Inc., 6034 W. Courtyard Drive, Austin, TX 78730, USA. Meetesh_Karia @trilogy.com., US#TAB#","institution_ids":["https://openalex.org/I4210165926"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5058649592"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":2.3122,"has_fulltext":false,"cited_by_count":32,"citation_normalized_percentile":{"value":0.8892432,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"33","issue":"2","first_page":"227","last_page":"242"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.9943000078201294,"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/polytope","display_name":"Polytope","score":0.7723481059074402},{"id":"https://openalex.org/keywords/theory-of-computation","display_name":"Theory of computation","score":0.6251630187034607},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6009291410446167},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5970293283462524},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5061842799186707},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4912199378013611},{"id":"https://openalex.org/keywords/convex-polytope","display_name":"Convex polytope","score":0.4637947678565979},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3731344938278198},{"id":"https://openalex.org/keywords/convex-analysis","display_name":"Convex analysis","score":0.26001882553100586},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.21767497062683105},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.2119026482105255},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.14173811674118042},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13257604837417603}],"concepts":[{"id":"https://openalex.org/C145691206","wikidata":"https://www.wikidata.org/wiki/Q747980","display_name":"Polytope","level":2,"score":0.7723481059074402},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.6251630187034607},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6009291410446167},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5970293283462524},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5061842799186707},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4912199378013611},{"id":"https://openalex.org/C110943637","wikidata":"https://www.wikidata.org/wiki/Q4129097","display_name":"Convex polytope","level":5,"score":0.4637947678565979},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3731344938278198},{"id":"https://openalex.org/C12108790","wikidata":"https://www.wikidata.org/wiki/Q2234833","display_name":"Convex analysis","level":4,"score":0.26001882553100586},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.21767497062683105},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.2119026482105255},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.14173811674118042},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13257604837417603}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/s00453-001-0111-x","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00453-001-0111-x","pdf_url":null,"source":{"id":"https://openalex.org/S89324355","display_name":"Algorithmica","issn_l":"0178-4617","issn":["0178-4617","1432-0541"],"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Algorithmica","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.112.8163","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.8163","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://biogeometry.duke.edu/pubs-pankaj/papers/short-impl.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.35.7604","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.35.7604","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/~sariel/papers/99/navigator.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.6.2072","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.6.2072","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://valis.cs.uiuc.edu/~sariel/research/papers/99/nav/nav.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W111486705","https://openalex.org/W1562281518","https://openalex.org/W1573473130","https://openalex.org/W1980197133","https://openalex.org/W1990480988","https://openalex.org/W1993264991","https://openalex.org/W2005538657","https://openalex.org/W2021587133","https://openalex.org/W2024693023","https://openalex.org/W2037134555","https://openalex.org/W2042746037","https://openalex.org/W2063071084","https://openalex.org/W2072019354","https://openalex.org/W2081777693","https://openalex.org/W2085789363","https://openalex.org/W2086489058","https://openalex.org/W2103185221","https://openalex.org/W2108567935","https://openalex.org/W2132026455","https://openalex.org/W2162703138"],"related_works":["https://openalex.org/W4287022798","https://openalex.org/W2901329027","https://openalex.org/W1995089671","https://openalex.org/W1990911204","https://openalex.org/W2069107464","https://openalex.org/W2768257653","https://openalex.org/W2557288725","https://openalex.org/W3012067785","https://openalex.org/W4243575619","https://openalex.org/W1607687497"],"abstract_inverted_index":null,"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}