scholarly journals On the Stretch Factor of Polygonal Chains

2021 ◽  
Vol 35 (3) ◽  
pp. 1592-1614
Author(s):  
Ke Chen ◽  
Adrian Dumitrescu ◽  
Wolfgang Mulzer ◽  
Csaba D. Tóth
Keyword(s):  
Stretch Factor ◽  
Polygonal Chains

Stretch Factor

2008 ◽  
pp. 906-906
Author(s):  
Ming-Yang Kao
Keyword(s):  
Stretch Factor

Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance

2008 ◽  
pp. 630-641 ◽  
Author(s):  
Sergey Bereg ◽  
Minghui Jiang ◽  
Wencheng Wang ◽  
Boting Yang ◽  
Binhai Zhu
Keyword(s):  
Fréchet Distance ◽  
Frechet Distance ◽  
Polygonal Chains

Enumeration of Wiener indices in random polygonal chains

2019 ◽  
Vol 469 (2) ◽  
pp. 537-548
Author(s):  
Shouliu Wei ◽  
Wai Chee Shiu
Keyword(s):  
Polygonal Chains

T-Spanner Problem

2017 ◽  
pp. 1-21
Author(s):  
Riham Moharam ◽  
Ehab Morsy ◽  
Ismail A. Ismail
Keyword(s):  
Communication Networks ◽  
Spanning Tree ◽  
Weighted Graph ◽  
Combinatorial Optimization Problem ◽  
Stretch Factor ◽  
A Value ◽  
Shortest Distance ◽  
Distance Approximation ◽  
Maximum Stretch

The t-spanner problem is a popular combinatorial optimization problem and has different applications in communication networks and distributed systems. This chapter considers the problem of constructing a t-spanner subgraph H in a given undirected edge-weighted graph G in the sense that the distance between every pair of vertices in H is at most t times the shortest distance between the two vertices in G. The value of t, called the stretch factor, quantifies the quality of the distance approximation of the corresponding t-spanner subgraph. This chapter studies two variations of the problem, the Minimum t-Spanner Subgraph (MtSS) and the Minimum Maximum Stretch Spanning Tree(MMST). Given a value for the stretch factor t, the MtSS problem asks to find the t-spanner subgraph of the minimum total weight in G. The MMST problem looks for a tree T in G that minimizes the maximum distance between all pairs of vertices in V (i.e., minimizing the stretch factor of the constructed tree). It is easy to conclude from the literatures that the above problems are NP-hard. This chapter presents genetic algorithms that returns a high quality solution for those two problems.

scholarly journals Constrained Hopping Traversability Analysis on Non-Uniform Polygonal Chains

IEEE Access ◽  
2020 ◽  
Vol 8 ◽  
pp. 36691-36701
Author(s):  
Saurabh Upadhyay ◽  
A. Pedro Aguiar
Keyword(s):  
Polygonal Chains

There are Plane Spanners of Degree 4 and Moderate Stretch Factor

2015 ◽  
Vol 53 (3) ◽  
pp. 514-546 ◽  
Author(s):  
Nicolas Bonichon ◽  
Iyad Kanj ◽  
Ljubomir Perković ◽  
Ge Xia
Keyword(s):  
Stretch Factor
Sign in / Sign up

Export Citation Format

Share Document