2021
DOI: 10.1007/978-3-030-83508-8_47
|View full text |Cite
|
Sign up to set email alerts
|

Reverse Shortest Path Problem for Unit-Disk Graphs

Abstract: Given a set P of n points in the plane, the unit-disk graph G r (P ) with respect to a parameter r is an undirected graph whose vertex set is P such that an edge connects two points p, q ∈ P if the Euclidean distance between p and q is at most r (the weight of the edge is 1 in the unweighted case and is the distance between p and q in the weighted case). Given a value λ > 0 and two points s and t of P , we consider the following reverse shortest path problem: computing the smallest r such that the shortest pat… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 33 publications
0
2
0
Order By: Relevance
“…Cloud Server Latency Model. When the cloud server receives all the computing data uploaded by EN, it will plan appropriate resources for each computer and issue instructions to the following computers for information processing [19]. Similar to the time delay model of EN, let…”
Section: En Time Delay Modelmentioning
confidence: 99%
See 1 more Smart Citation
“…Cloud Server Latency Model. When the cloud server receives all the computing data uploaded by EN, it will plan appropriate resources for each computer and issue instructions to the following computers for information processing [19]. Similar to the time delay model of EN, let…”
Section: En Time Delay Modelmentioning
confidence: 99%
“…Equation (17) indicates that in a TDMA frame, the total amount of transmission time slots allocated to all devices does not exceed the frame length T. Constraint formula (18) indicates that the data distortion rate of any mobile device cannot exceed the maximum distortion rate of the data capacity. e restriction formula (19) represents the data range of the division ratio of the emotional calculation data of each mobile device. Constraint formulas (20) and (21) indicate that the total amount of edge emotional computing resource data allocated to all mobile devices does not exceed the maximum emotional data computing capacity of the cloud server and each edge server.…”
Section: Music Emotional Assignment Algorithm On Edgementioning
confidence: 99%