论文信息 - Bicriterion Path Problems

Bicriterion Path Problems

Bicriterion path problems in directed graphs are systematically studied. A series of ten problems are defined and their computational complexity examined. Algorithms are provided for some of them, including polynomial algorithms for the MAXMIN-MAXMIN problem and the MINSUM-MAXMIN problem, and a pseudo-polynomial exact algorithm as well as a fully polynomial approximation scheme for the MINSUM-MINSUM problem.

Pierre Hansen | P. Hansen

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

[2] M. Pollack,et al. Link Error Control and Network Route Selection , 1961 .

[3] W. W. Hardgrave,et al. On the Relation Between the Traveling-Salesman and the Longest-Path Problems , 1962 .

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

[5] S. N. Narahari Pandit,et al. Letter to the Editor-Some Observations on the Longest Path Problem , 1964 .

[6] C. Berge. Graphes et hypergraphes , 1970 .

[7] Ivan T. Frisch,et al. Communication, transmission, and transportation networks , 1971 .

[8] Michael H. Moore. On the Fastest Route for Convoy-Type Traffic in Flowrate-Constrained Networks , 1976 .

[9] Y. Aneja,et al. The constrained shortest path problem , 1978 .

[10] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[11] Ahnont Wongseelashote. Semirings and path spaces , 1979, Discret. Math..