{"id":"https://openalex.org/W2076014803","doi":"https://doi.org/10.1137/s0097539799361671","title":"Approximating the Stretch Factor of Euclidean Graphs","display_name":"Approximating the Stretch Factor of Euclidean Graphs","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W2076014803","doi":"https://doi.org/10.1137/s0097539799361671","mag":"2076014803"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539799361671","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799361671","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/A5068890173","display_name":"Giri Narasimhan","orcid":"https://orcid.org/0000-0003-0535-4871"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Giri Narasimhan","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5108374265","display_name":"Michiel Smid","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michiel Smid","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5068890173"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.2863,"has_fulltext":false,"cited_by_count":79,"citation_normalized_percentile":{"value":0.94419808,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"30","issue":"3","first_page":"978","last_page":"989"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9998000264167786,"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/T11106","display_name":"Data Management and Algorithms","score":0.9961000084877014,"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/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.9817000031471252,"subfield":{"id":"https://openalex.org/subfields/2305","display_name":"Environmental Engineering"},"field":{"id":"https://openalex.org/fields/23","display_name":"Environmental Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.786806046962738},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6819243431091309},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.6760762929916382},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5712794065475464},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5702285170555115},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5495608448982239},{"id":"https://openalex.org/keywords/euclidean-shortest-path","display_name":"Euclidean shortest path","score":0.5206936597824097},{"id":"https://openalex.org/keywords/planar-graph","display_name":"Planar graph","score":0.44625598192214966},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44375836849212646},{"id":"https://openalex.org/keywords/euclidean-distance-matrix","display_name":"Euclidean distance matrix","score":0.42076486349105835},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.35299792885780334},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.31874996423721313},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.17602556943893433},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06670400500297546}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.786806046962738},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6819243431091309},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.6760762929916382},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5712794065475464},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5702285170555115},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5495608448982239},{"id":"https://openalex.org/C170836113","wikidata":"https://www.wikidata.org/wiki/Q5406126","display_name":"Euclidean shortest path","level":5,"score":0.5206936597824097},{"id":"https://openalex.org/C101837359","wikidata":"https://www.wikidata.org/wiki/Q547823","display_name":"Planar graph","level":3,"score":0.44625598192214966},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44375836849212646},{"id":"https://openalex.org/C171558263","wikidata":"https://www.wikidata.org/wiki/Q5406122","display_name":"Euclidean distance matrix","level":3,"score":0.42076486349105835},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.35299792885780334},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.31874996423721313},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.17602556943893433},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06670400500297546}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/s0097539799361671","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539799361671","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.42.7922","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.42.7922","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.msci.memphis.edu/~giri/papers/stretch.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.50.2802","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.50.2802","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://isgwww.cs.uni-magdeburg.de/~michiel/improvedstretch.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.73.1980","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.73.1980","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.fiu.edu/~giri/papers/stretch.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":24,"referenced_works":["https://openalex.org/W1481010420","https://openalex.org/W1552092932","https://openalex.org/W1555007779","https://openalex.org/W2002041206","https://openalex.org/W2005314985","https://openalex.org/W2011999472","https://openalex.org/W2020284736","https://openalex.org/W2028430839","https://openalex.org/W2031874971","https://openalex.org/W2046866753","https://openalex.org/W2050809450","https://openalex.org/W2054011861","https://openalex.org/W2059985428","https://openalex.org/W2062254875","https://openalex.org/W2093521781","https://openalex.org/W2097747425","https://openalex.org/W2113604744","https://openalex.org/W2114585066","https://openalex.org/W2120424341","https://openalex.org/W2148073303","https://openalex.org/W2176446742","https://openalex.org/W2752885492","https://openalex.org/W2888871578","https://openalex.org/W4245082111"],"related_works":["https://openalex.org/W2156431668","https://openalex.org/W2018146256","https://openalex.org/W2040572217","https://openalex.org/W2237480599","https://openalex.org/W191849398","https://openalex.org/W2388410942","https://openalex.org/W2009987517","https://openalex.org/W2360981904","https://openalex.org/W4293167680","https://openalex.org/W2776102956"],"abstract_inverted_index":{"There":[0],"are":[1,25,35,51],"several":[2],"results":[3],"available":[4],"in":[5,22,28,33,45,49,91,134],"the":[6,40,62,76,80,86,94,105,113,135,149,169],"literature":[7],"dealing":[8],"with":[9],"efficient":[10,145],"construction":[11],"of":[12,19,56,83,152],"t-spanners":[13,24],"for":[14,147],"a":[15,54,67],"given":[16,66],"set":[17,73,77],"S":[18],"n":[20],"points":[21],"$\\IR^d$.":[23],"Euclidean":[26,41,68,96,153],"graphs":[27,154],"which":[29],"distances":[30,42,48,90],"between":[31,43,89],"vertices":[32],"G":[34,50,70,92],"at":[36,57],"most":[37,58],"t":[38],"times":[39],"them;":[44],"other":[46],"words,":[47],"\"stretched\"":[52],"by":[53,103,126],"factor":[55,82,115,151],"t.":[59],"We":[60,138],"consider":[61],"interesting":[63],"dual":[64],"problem:":[65],"graph":[69,136],"whose":[71],"vertex":[72],"corresponds":[74],"to":[75,112,143,172],"S,":[78],"compute":[79],"stretch":[81,114,150],"G,":[84],"i.e.,":[85],"maximum":[87],"ratio":[88],"and":[93,162,175],"corresponding":[95],"distances.":[97],"It":[98],"can":[99,122],"trivially":[100],"be":[101,123],"solved":[102],"solving":[104],"all-pairs-shortest-path":[106],"problem.":[107],"However,":[108],"if":[109],"an":[110],"approximation":[111],"is":[116,171],"sufficient,":[117],"then":[118],"we":[119],"show":[120],"it":[121],"efficiently":[124],"computed":[125],"making":[127],"only":[128],"O(n)":[129],"approximate":[130],"shortest":[131],"path":[132],"queries":[133],"G.":[137],"apply":[139],"this":[140],"surprising":[141],"result":[142],"obtain":[144],"algorithms":[146],"approximating":[148],"such":[155],"as":[156],"paths,":[157],"cycles,":[158],"trees,":[159],"planar":[160],"graphs,":[161],"general":[163],"graphs.":[164],"The":[165],"main":[166],"idea":[167],"behind":[168],"algorithm":[170],"use":[173],"Callahan":[174],"Kosaraju's":[176],"well-separated":[177],"pair":[178],"decomposition.":[179]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}