{"id":"https://openalex.org/W2071776560","doi":"https://doi.org/10.1137/050635675","title":"Improving the Stretch Factor of a Geometric Network by Edge Augmentation","display_name":"Improving the Stretch Factor of a Geometric Network by Edge Augmentation","publication_year":2008,"publication_date":"2008-01-01","ids":{"openalex":"https://openalex.org/W2071776560","doi":"https://doi.org/10.1137/050635675","mag":"2071776560"},"language":"en","primary_location":{"id":"doi:10.1137/050635675","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050635675","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":true,"oa_status":"green","oa_url":"https://research.tue.nl/en/publications/c7dd29c9-6ba3-4c04-999d-e4a5bb302c28","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048590083","display_name":"Mohammad Farshi","orcid":"https://orcid.org/0000-0002-1986-2722"},"institutions":[{"id":"https://openalex.org/I188497080","display_name":"Carleton College","ror":"https://ror.org/03jep7677","country_code":"US","type":"education","lineage":["https://openalex.org/I188497080"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad Farshi","raw_affiliation_strings":["mfarshi@cg.scs.carleton.ca#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"mfarshi@cg.scs.carleton.ca#TAB#","institution_ids":["https://openalex.org/I188497080"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001427452","display_name":"Panos Giannopoulos","orcid":"https://orcid.org/0000-0002-6261-1961"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Panos Giannopoulos","raw_affiliation_strings":["panos@informatik.tu-berlin.de#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"panos@informatik.tu-berlin.de#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087003217","display_name":"Joachim Gudmundsson","orcid":"https://orcid.org/0000-0002-6778-7990"},"institutions":[{"id":"https://openalex.org/I42894916","display_name":"Data61","ror":"https://ror.org/03q397159","country_code":"AU","type":"other","lineage":["https://openalex.org/I1292875679","https://openalex.org/I2801453606","https://openalex.org/I42894916","https://openalex.org/I4387156119"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Joachim Gudmundsson","raw_affiliation_strings":["joachim.gudmundsson@nicta.com.au#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"joachim.gudmundsson@nicta.com.au#TAB#","institution_ids":["https://openalex.org/I42894916"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":4.469,"has_fulltext":false,"cited_by_count":25,"citation_normalized_percentile":{"value":0.9372554,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"38","issue":"1","first_page":"226","last_page":"240"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":1.0,"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":1.0,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.9871000051498413,"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/combinatorics","display_name":"Combinatorics","score":0.6842215657234192},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5803643465042114},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.566612720489502},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5570884346961975},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5281757712364197},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5225231647491455},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5142052173614502},{"id":"https://openalex.org/keywords/geometric-networks","display_name":"Geometric networks","score":0.5015227794647217},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.47882726788520813},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.43134158849716187},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.37038150429725647},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.33089715242385864},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2896777391433716},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2494988739490509},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.1288745105266571},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.07014742493629456}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6842215657234192},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5803643465042114},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.566612720489502},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5570884346961975},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5281757712364197},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5225231647491455},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5142052173614502},{"id":"https://openalex.org/C49777392","wikidata":"https://www.wikidata.org/wiki/Q5535495","display_name":"Geometric networks","level":3,"score":0.5015227794647217},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.47882726788520813},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.43134158849716187},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.37038150429725647},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.33089715242385864},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2896777391433716},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2494988739490509},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.1288745105266571},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.07014742493629456}],"mesh":[],"locations_count":5,"locations":[{"id":"doi:10.1137/050635675","is_oa":false,"landing_page_url":"https://doi.org/10.1137/050635675","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:pure.tue.nl:openaire/c7dd29c9-6ba3-4c04-999d-e4a5bb302c28","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/c7dd29c9-6ba3-4c04-999d-e4a5bb302c28","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Farshi, M, Giannopoulos, P & Gudmundsson, J 2008, 'Improving the stretch factor of a geometric network by edge augmentation', SIAM Journal on Computing, vol. 38, no. 1, pp. 226-240. https://doi.org/10.1137/050635675","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:649466","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=649466","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0097-5397","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:library.tue.nl:649466","is_oa":false,"landing_page_url":"http://repository.tue.nl/649466","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ISSN:0097-5397","raw_type":"Article / Letter to the editor"},{"id":"pmh:tue:oai:pure.tue.nl:publications/c7dd29c9-6ba3-4c04-999d-e4a5bb302c28","is_oa":true,"landing_page_url":"https://research.tue.nl/nl/publications/c7dd29c9-6ba3-4c04-999d-e4a5bb302c28","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"SIAM Journal on Computing, 38(1), 226 - 240. Society for Industrial and Applied Mathematics (SIAM)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:pure.tue.nl:openaire/c7dd29c9-6ba3-4c04-999d-e4a5bb302c28","is_oa":true,"landing_page_url":"https://research.tue.nl/en/publications/c7dd29c9-6ba3-4c04-999d-e4a5bb302c28","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Farshi, M, Giannopoulos, P & Gudmundsson, J 2008, 'Improving the stretch factor of a geometric network by edge augmentation', SIAM Journal on Computing, vol. 38, no. 1, pp. 226-240. https://doi.org/10.1137/050635675","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1507638461","https://openalex.org/W1524692559","https://openalex.org/W1552092932","https://openalex.org/W1586736974","https://openalex.org/W1727362095","https://openalex.org/W1768571955","https://openalex.org/W1869076784","https://openalex.org/W1983502795","https://openalex.org/W1991530421","https://openalex.org/W1997973101","https://openalex.org/W2002041206","https://openalex.org/W2004476837","https://openalex.org/W2029772672","https://openalex.org/W2042333226","https://openalex.org/W2054011861","https://openalex.org/W2055362092","https://openalex.org/W2055488252","https://openalex.org/W2076014803","https://openalex.org/W2093521781","https://openalex.org/W2097333461","https://openalex.org/W2106110423","https://openalex.org/W2113604744","https://openalex.org/W2148073303","https://openalex.org/W2165849228","https://openalex.org/W2167366051","https://openalex.org/W2203464362","https://openalex.org/W3098722153"],"related_works":["https://openalex.org/W4327811110","https://openalex.org/W2950948762","https://openalex.org/W2966581227","https://openalex.org/W4301948600","https://openalex.org/W1974100545","https://openalex.org/W2407321536","https://openalex.org/W2021372200","https://openalex.org/W2314909417","https://openalex.org/W1846361160","https://openalex.org/W3152988225"],"abstract_inverted_index":{"Given":[0],"a":[1,44,58,73],"Euclidean":[2],"graph":[3,31,45],"G":[4,22],"in":[5,51,57,80],"$\\mathbb{R}^d$":[6],"with":[7,46],"n":[8],"vertices":[9],"and":[10],"m":[11],"edges,":[12],"we":[13,70,91],"consider":[14,92],"the":[15,25,29,35,40,66,77,88],"problem":[16],"of":[17,28,43],"adding":[18],"an":[19],"edge":[20,48],"to":[21],"such":[23],"that":[24,72],"stretch":[26,41],"factor":[27,42],"resulting":[30,56],"is":[32],"minimized.":[33],"Currently,":[34],"fastest":[36],"algorithm":[37,63],"for":[38,64],"computing":[39,65],"positive":[47],"weights":[49],"runs":[50],"$\\cal{O}$$(nm+n^2":[52],"\\log":[53,61],"n)$":[54],"time,":[55],"trivial":[59],"$\\cal{O}$$(n^3m+n^4":[60],"n)$-time":[62],"optimal":[67,78],"edge.":[68],"First,":[69],"show":[71],"simple":[74],"modification":[75],"yields":[76],"solution":[79],"$\\cal{O}$$(n^4)$":[81],"time":[82,90],"using":[83],"$\\cal{O}$$(n^2)$":[84],"space.":[85],"To":[86],"reduce":[87],"running":[89],"several":[93],"approximation":[94],"algorithms.":[95]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}