Abstract | ||
---|---|---|
)Esther M. ArkinyYi-Jen ChiangzJoseph S. B. MitchellxSteven S. Skiena--Tae-Cheon YangkTo appear in Proc. ACM-SIAM Symposium on Discrete Algorithms (1997)AbstractWe study the problem of computing a Hamiltonian tour(cycle) or path on a set of points in order to maximize theminimum edge length in the tour or path. This "maximumscatter" TSP is closely related to the bottleneck TSP, and ismotivated by applications in manufacturing (e.g., sequencingof rivet operations) and ... |
Year | DOI | Venue |
---|---|---|
1997 | 10.1145/314161.314258 | SODA |
Field | DocType | Citations |
Discrete mathematics,Computer science | Conference | 1 |
PageRank | References | Authors |
0.37 | 2 | 5 |
Name | Order | Citations | PageRank |
---|---|---|---|
Esther M. Arkin | 1 | 1207 | 158.07 |
Yi-jen Chiang | 2 | 503 | 38.21 |
Joseph S.B. Mitchell | 3 | 4329 | 428.84 |
S S Skiena | 4 | 3380 | 292.51 |
Tae-Cheon Yang | 5 | 32 | 3.71 |