{"id":"https://openalex.org/W4225987021","doi":"https://doi.org/10.1007/978-3-030-96731-4_12","title":"Reverse Shortest Path Problem in\u00a0Weighted Unit-Disk Graphs","display_name":"Reverse Shortest Path Problem in\u00a0Weighted Unit-Disk Graphs","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W4225987021","doi":"https://doi.org/10.1007/978-3-030-96731-4_12"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-96731-4_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-96731-4_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5100457231","display_name":"Haitao Wang","orcid":"https://orcid.org/0000-0002-6775-0346"},"institutions":[{"id":"https://openalex.org/I121980950","display_name":"Utah State University","ror":"https://ror.org/00h6set76","country_code":"US","type":"education","lineage":["https://openalex.org/I121980950"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Haitao Wang","raw_affiliation_strings":["Department of Computer Science, Utah State University, Logan, UT, 84322, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utah State University, Logan, UT, 84322, USA","institution_ids":["https://openalex.org/I121980950"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056552746","display_name":"Yiming Zhao","orcid":"https://orcid.org/0000-0001-5080-5251"},"institutions":[{"id":"https://openalex.org/I121980950","display_name":"Utah State University","ror":"https://ror.org/00h6set76","country_code":"US","type":"education","lineage":["https://openalex.org/I121980950"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yiming Zhao","raw_affiliation_strings":["Department of Computer Science, Utah State University, Logan, UT, 84322, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Utah State University, Logan, UT, 84322, USA","institution_ids":["https://openalex.org/I121980950"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100457231"],"corresponding_institution_ids":["https://openalex.org/I121980950"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.6099,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.85422741,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":95,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"135","last_page":"146"},"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/T11164","display_name":"Remote Sensing and LiDAR Applications","score":0.9847000241279602,"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"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9728000164031982,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8262168169021606},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7184587717056274},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6168005466461182},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5566591620445251},{"id":"https://openalex.org/keywords/lambda","display_name":"Lambda","score":0.5264573693275452},{"id":"https://openalex.org/keywords/distance","display_name":"Distance","score":0.47716134786605835},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4720737934112549},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.44360819458961487},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42735493183135986},{"id":"https://openalex.org/keywords/shortest-path-tree","display_name":"Shortest-path tree","score":0.422194242477417},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36391109228134155},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2133478820323944},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08704951405525208},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.06420940160751343}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8262168169021606},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7184587717056274},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6168005466461182},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5566591620445251},{"id":"https://openalex.org/C2778113609","wikidata":"https://www.wikidata.org/wiki/Q10897","display_name":"Lambda","level":2,"score":0.5264573693275452},{"id":"https://openalex.org/C54385418","wikidata":"https://www.wikidata.org/wiki/Q2742711","display_name":"Distance","level":4,"score":0.47716134786605835},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4720737934112549},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.44360819458961487},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42735493183135986},{"id":"https://openalex.org/C23394520","wikidata":"https://www.wikidata.org/wiki/Q4919350","display_name":"Shortest-path tree","level":3,"score":0.422194242477417},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36391109228134155},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2133478820323944},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08704951405525208},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.06420940160751343},{"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/C120665830","wikidata":"https://www.wikidata.org/wiki/Q14620","display_name":"Optics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-030-96731-4_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-030-96731-4_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"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":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:digitalcommons.usu.edu:computer_science_facpubs-1040","is_oa":false,"landing_page_url":"https://digitalcommons.usu.edu/computer_science_facpubs/38","pdf_url":null,"source":{"id":"https://openalex.org/S4377196327","display_name":"Digital Commons - USU (Utah State University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I121980950","host_organization_name":"Utah State University","host_organization_lineage":["https://openalex.org/I121980950"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Faculty and Staff Publications","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":19,"referenced_works":["https://openalex.org/W1577976795","https://openalex.org/W1966229055","https://openalex.org/W1967985699","https://openalex.org/W1985655539","https://openalex.org/W1996896896","https://openalex.org/W2004899468","https://openalex.org/W2011297770","https://openalex.org/W2027277859","https://openalex.org/W2060978628","https://openalex.org/W2070164574","https://openalex.org/W2126876121","https://openalex.org/W2132026455","https://openalex.org/W2159525520","https://openalex.org/W2962776480","https://openalex.org/W3037400150","https://openalex.org/W3137365097","https://openalex.org/W3197652730","https://openalex.org/W4244317572","https://openalex.org/W6633101894"],"related_works":["https://openalex.org/W3032870653","https://openalex.org/W3149063625","https://openalex.org/W2357644463","https://openalex.org/W1996697202","https://openalex.org/W94062305","https://openalex.org/W4206588173","https://openalex.org/W2282234940","https://openalex.org/W2237480599","https://openalex.org/W2500259424","https://openalex.org/W2286607091"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":2}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}