Abstract
Thek-Centrum Shortest Path Problem (kCSP[s, t]) is to minimize the sum of thek longest arcs in any (simple)s−t path containing at leastk arcs, wherek is a positive integer.kCSP is introduced and is shown to be NP-Hard, although it is polynomially solvable ifk is constrained to be no greater than the number of arcs in ans−t path with fewest arcs. Some properties of the problem are studied and a new weakly dual problem is also introduced.
Key Words
Shortes path k-centrumAMS subject classification
90B10 90C27 90C35Preview
Unable to display preview. Download preview PDF.
References
- Ahuja R.K., Magnanti T.L. and Orlin J.B. (1993).Network Flows. Prentice Hall.Google Scholar
- Andreatta G. and Mason F.M. (1985). Properties ofk-Centra in a Tree Network.Networks 15, 21–25.CrossRefGoogle Scholar
- Edmonds J. and Fulkerson D. R. (1970). Bottleneck Extrema.Journal of Combinatorial Theory 8, 299–306.CrossRefGoogle Scholar
- Dijkstra E. (1959). A Note on Two Problems in Connection with Graphs.Numeriche Mathematics 1, 269–271.CrossRefGoogle Scholar
- Ergun F., Sinha R. and Zhang L. (2002). An Improving, FTPAS for Restricted Shortest Path.Information Processing Letters 83, 287–291.CrossRefGoogle Scholar
- Ford L.R. and Fulkerson D.R. (1956). Maximal Flow Through a Network.Canadian Journal of Mathematics 9, 399–404.Google Scholar
- Fredman M.L. and Tarjan R.E. (1987). Fibonacci Heaps and Their Uses in Improved Network Optimization Algorithms.Journal of the ACM 34, 596–615.CrossRefGoogle Scholar
- Garey M.R. and Johnson D.S. (1979).Computers and Intractability. Freeman.Google Scholar
- Guerriero F., Musmanno R., Lacagnina V. and Pecorella A. (2001). A Class of Label-Correcting Methods for thek-Shortest Paths Problem.Operations Research 49, 423–429.CrossRefGoogle Scholar
- Hu T.C. (1961). The Maximum Capacity Route Problem.Operations Research 9, 898–900.CrossRefGoogle Scholar
- Mote J., Murthy I. and Olson D.L. (1991). A Parametric Approach to Solving Bicriterion Shortest Path Problems.European Journal of Operational Research 53, 81–92.CrossRefGoogle Scholar
- Sancho N.G.F. (1994). Shortest-Path Problems with Time Windows on Nodes and Arcs.Journal of Mathematical Analysis and Applications 186, 643–648.CrossRefGoogle Scholar
- Slater P.J. (1978). Centers to Centroids in a Graph.Journal of Graph Theory 2, 209–222.CrossRefGoogle Scholar
- Tamir A. (2001). Thek-Centrum Multi-Facility Location Problem.Discrete Applied Mathematics 109, 293–307.CrossRefGoogle Scholar
Copyright information
© Springer 2006