论文信息 - Paths with Minimum Range and Ratio of Arc Lengths

Paths with Minimum Range and Ratio of Arc Lengths

Two new path problems in graphs are studied: MINRANGE, i.e., find a path from a vertex s to a vertex t with the smallest possible range of arc lengths, and MINRATIO, i.e., find such a path for which the ratio of the largest to the smallest arc length is minimum. Several bicriterion extensions of these problems are also considered.

Pierre Hansen | Tsevi Vovor | Giovanni Storchi

[1] G. Gallo,et al. SHORTEST PATH METHODS: A UNIFYING APPROACH , 1986 .

[2] Peter L. Hammer,et al. Discrete Applied Mathematics , 1993 .

[3] Ernesto de Queirós Vieira Martins. An algorithm to determine a path with minimal cost/capacity ratio , 1984, Discret. Appl. Math..

[4] Mikkel Thorup,et al. On RAM priority queues , 1996, SODA '96.

[5] B. M. Fulk. MATH , 1992 .

[6] I. Frisch. Optimum Routes in Communication Systems with Channel Capacities and Channel Reliabilities , 1963 .

[7] G. Dantzig,et al. FINDING A CYCLE IN A GRAPH WITH MINIMUM COST TO TIME RATIO WITH APPLICATION TO A SHIP ROUTING PROBLEM , 1966 .

[8] M. I. Henig. The shortest path problem with two objective functions , 1986 .

[9] M. Minoux,et al. Structures algébriques généralisées des problèmes de cheminement dans les graphes , 1976 .

[10] Pierre Hansen,et al. Bicriterion Path Problems , 1980 .

[11] H. Kunzi,et al. Lectu re Notes in Economics and Mathematical Systems , 1975 .

[12] E. Martins. On a special class of bicriterion path problems , 1984 .

[13] Ilker Baybars,et al. A survey of exact algorithms for the simple assembly line balancing , 1986 .

[14] Edsger W. Dijkstra,et al. A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[15] Abraham P. Punnen. A linear time algorithm for the maximum capacity path problem , 1991 .