{"id":"https://openalex.org/W2048557227","doi":"https://doi.org/10.1145/1064092.1064143","title":"Finding the best shortcut in a geometric network","display_name":"Finding the best shortcut in a geometric network","publication_year":2005,"publication_date":"2005-06-06","ids":{"openalex":"https://openalex.org/W2048557227","doi":"https://doi.org/10.1145/1064092.1064143","mag":"2048557227"},"language":"en","primary_location":{"id":"doi:10.1145/1064092.1064143","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1064092.1064143","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-first annual symposium on Computational geometry","raw_type":"proceedings-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/A5048590083","display_name":"Mohammad Farshi","orcid":"https://orcid.org/0000-0002-1986-2722"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"Mohammad Farshi","raw_affiliation_strings":["TU Eindhoven, The Netherlands","TU Eindhoven, the Netherlands"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TU Eindhoven, The Netherlands","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"TU Eindhoven, the Netherlands","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001427452","display_name":"Panos Giannopoulos","orcid":"https://orcid.org/0000-0002-6261-1961"},"institutions":[{"id":"https://openalex.org/I75951250","display_name":"Freie Universit\u00e4t Berlin","ror":"https://ror.org/046ak2485","country_code":"DE","type":"education","lineage":["https://openalex.org/I75951250"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Panos Giannopoulos","raw_affiliation_strings":["Freie Universit\u00e4t Berlin, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Freie Universit\u00e4t Berlin, Germany","institution_ids":["https://openalex.org/I75951250"]}]},{"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":["NICTA, Sydney, Australia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"NICTA, Sydney, Australia","institution_ids":["https://openalex.org/I42894916"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.4147,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.92197683,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"327","last_page":"335"},"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.9998999834060669,"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.9998999834060669,"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.9968000054359436,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9955999851226807,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6303378343582153},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.5991805791854858},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.5934417843818665},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5593372583389282},{"id":"https://openalex.org/keywords/geometric-networks","display_name":"Geometric networks","score":0.5559310913085938},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.5515185594558716},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5494977831840515},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5299378633499146},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4478781521320343},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.44390055537223816},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4163467586040497},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.41460832953453064},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4140605628490448},{"id":"https://openalex.org/keywords/graph-theory","display_name":"Graph theory","score":0.38548266887664795},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34841322898864746},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.06974390149116516}],"concepts":[{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6303378343582153},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.5991805791854858},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.5934417843818665},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5593372583389282},{"id":"https://openalex.org/C49777392","wikidata":"https://www.wikidata.org/wiki/Q5535495","display_name":"Geometric networks","level":3,"score":0.5559310913085938},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.5515185594558716},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5494977831840515},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5299378633499146},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4478781521320343},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.44390055537223816},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4163467586040497},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41460832953453064},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4140605628490448},{"id":"https://openalex.org/C88230418","wikidata":"https://www.wikidata.org/wiki/Q131476","display_name":"Graph theory","level":2,"score":0.38548266887664795},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34841322898864746},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.06974390149116516},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":11,"locations":[{"id":"doi:10.1145/1064092.1064143","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1064092.1064143","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twenty-first annual symposium on Computational geometry","raw_type":"proceedings-article"},{"id":"pmh:oai:pure.tue.nl:openaire_cris_publications/5b3f3c73-1edc-4b01-ad5d-7ab46e1144ae","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/5b3f3c73-1edc-4b01-ad5d-7ab46e1144ae","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":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Farshi, M, Giannopoulos, P & Gudmundsson, J 2005, Finding the best shortcut in a geometric network. in J S B Mitchell & G Rote (eds), Proceedings 21st Annual ACM Symposium on Computational Geometry (Pisa, Italy, June 6-8, 2005). Association for Computing Machinery, Inc., New York, pp. 327-335.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:660945","is_oa":false,"landing_page_url":"http://library.tue.nl/csp/dare/LinkToRepository.csp?recordnumber=660945","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":"","raw_type":""},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.109.7995","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.7995","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.tau.ac.il/~panos/publications/shortcut_scg.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.583.5416","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.583.5416","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cg.scs.carleton.ca/~mfarshi/pub/SOCG05.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.91.9140","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.91.9140","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.gudmundsson.biz/HP_links/Papers/C-27.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.98.6642","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.98.6642","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.win.tue.nl/EWCG2005/Proceedings/8.pdf","raw_type":"text"},{"id":"pmh:oai:library.tue.nl:660945","is_oa":false,"landing_page_url":"http://repository.tue.nl/660945","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":"","raw_type":""},{"id":"pmh:oai:pure.tue.nl:publications/121adbb8-29e5-4c3a-9b22-a272bd4e814c","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/121adbb8-29e5-4c3a-9b22-a272bd4e814c","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:tue:oai:pure.tue.nl:publications/121adbb8-29e5-4c3a-9b22-a272bd4e814c","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/121adbb8-29e5-4c3a-9b22-a272bd4e814c","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Abstracts 21th European Workshop on Computational Geometry (EWCG 2005, Eindhoven, The Netherlands, March 9-11, 2005), 29 - 32","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:tue:oai:pure.tue.nl:publications/5b3f3c73-1edc-4b01-ad5d-7ab46e1144ae","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/5b3f3c73-1edc-4b01-ad5d-7ab46e1144ae","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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings 21st Annual ACM Symposium on Computational Geometry (Pisa, Italy, June 6-8, 2005), 327 - 335","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W125464309","https://openalex.org/W1499162805","https://openalex.org/W1507638461","https://openalex.org/W1524692559","https://openalex.org/W1548544813","https://openalex.org/W1552092932","https://openalex.org/W1555007779","https://openalex.org/W1586736974","https://openalex.org/W1727362095","https://openalex.org/W1768571955","https://openalex.org/W1869076784","https://openalex.org/W1966266942","https://openalex.org/W1983502795","https://openalex.org/W1991530421","https://openalex.org/W1997973101","https://openalex.org/W2002041206","https://openalex.org/W2004476837","https://openalex.org/W2020284736","https://openalex.org/W2029772672","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/W2118380034","https://openalex.org/W2148073303","https://openalex.org/W2165849228","https://openalex.org/W2167366051","https://openalex.org/W6633110055","https://openalex.org/W6633122356","https://openalex.org/W6664084369"],"related_works":["https://openalex.org/W2113270940","https://openalex.org/W2004283824","https://openalex.org/W2963158951","https://openalex.org/W2070751425","https://openalex.org/W1581210843","https://openalex.org/W1982530285","https://openalex.org/W2085573573","https://openalex.org/W1992104669","https://openalex.org/W2118860231","https://openalex.org/W2521054645"],"abstract_inverted_index":{"Given":[0],"a":[1,19,42,53,69,96],"Euclidean":[2,43],"graph":[3,29,44],"G":[4],"in":[5,46,52,76],"Rd":[6],"with":[7,99],"n":[8],"vertices":[9],"and":[10],"m":[11],"edges":[12],"we":[13,66,87],"consider":[14,88],"the":[15,23,27,33,38,62,73,84],"problem":[16],"of":[17,26,41],"adding":[18],"shortcut":[20],"such":[21],"that":[22,68],"stretch":[24,39],"factor":[25,40],"resulting":[28,51],"is":[30,95],"minimized.":[31],"Currently,":[32],"fastest":[34],"algorithm":[35,59,98],"for":[36,60],"computing":[37,61],"runs":[45],"O(mn+n2":[47],"log":[48,56],"n)":[49,57],"time,":[50],"trivial":[54],"O(mn3+n4":[55],"time":[58,78,101],"optimal":[63,74],"shortcut.":[64],"First,":[65],"show":[67],"simple":[70],"modification":[71],"yields":[72],"solution":[75],"O(n4)":[77],"using":[79,104],"O(n2)":[80,105],"space.":[81,106],"To":[82],"reduce":[83],"running":[85,100],"times":[86],"several":[89],"approximation":[90],"algorithms.":[91],"Our":[92],"main":[93],"result":[94],"(2+\u03b5)-approximation":[97],"O(nm+n2(log":[102],"n+1/\u03b53d))":[103]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}