Abstract
This paper discusses the shortest path problem in a general directed graph with n nodes and K cost scenarios (objectives). In order to choose a solution, the min-max criterion is applied. The min-max version of the problem is hard to approximate within Ω(log1−ϵK) for any ϵ>0 unless NP⊆DTIME(npolylogn) even for arc series-parallel graphs and within Ω(logn/loglogn) unless NP⊆ZPTIME(nloglogn) for acyclic graphs. The best approximation algorithm for the min-max shortest path problem in general graphs, known to date, has an approximation ratio of K. In this paper, an O˜(n) flow LP-based approximation algorithm for min-max shortest path in general graphs is constructed. It is also shown that the approximation ratio obtained is close to an integrality gap of the corresponding flow LP relaxation.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call