Abstract
Consider the generic situation that we have to select k alternatives from a given ground set, where each element in the ground set has a random arrival time and cost. Once we have done our selection, we will greedily select the first arriving alternative, and the total cost is the time we had to wait for this alternative plus its random cost. Our motivation to study this problem comes from public transportation, where each element in the ground set might correspond to a bus or train, and the usual user behavior is to greedily select the first option from a given set of alternatives at each stop. We consider the arguably most natural arrival time distributions for such a scenario: exponential distributions, uniform distributions, and distributions with mon. decreasing linear density functions. For exponential distributions, we show how to compute an optimal policy for a complete network, called a shortest path with alternatives, in \( {\mathcal O}( n ( \log n + \delta^3 ) ) \) time, where n is the number of nodes and δ is the maximal outdegree of any node, making this approach practicable for large networks if δ is relatively small. Moreover, for the latter two distributions, we give PTASs for the case that the distribution supports differ by at most a constant factor and only a constant number of hops are allowed in the network, both reasonable assumptions in practice. These results are obtained by combining methods from low-rank quasi-concave optimization with fractional programming. We finally complement them by showing that general distributions are NP-hard.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bertsekas, D.P., Tsitsiklis, J.N.: An analysis of stochastic shortest path problems. Math. Oper. Res. 16, 580–595 (1991)
Billionnet, A.: Approximation algorithms for fractional knapsack problems. Operations Research Letters 30(5), 336–342 (2002)
Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press (1990)
Correa, J., Fernandes, C., Wakabayashi, Y.: Approximating a class of combinatorial problems with rational objective function. Mathematical Programming 124, 255–269 (2010)
Dooly, D.R., Goldman, S.A., Scott, S.D.: TCP dynamic acknowledgment delay: Theory and practice (extended abstract). In: Proceedings of the 30th Annual ACM Symposium on the Theory of Computing (STOC 1998), pp. 389–398 (1998)
Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Operations Research 17(3), 395–412 (1969)
Dynkin, E.B.: The optimum choice of the instant for stopping a Markov process. Soviet Math. Dokl. 4 (1963)
Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press (1962)
Foschini, L., Hershberger, J., Subhash, S.: On the complexity of time-dependent shortest paths. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), pp. 327–341 (2011)
Hashizume, S., Fukushima, M., Katoh, N., Ibaraki, T.: Approximation algorithms for combinatorial fractional programming problems. Mathematical Programming 37, 255–267 (1987)
Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. Algorithmica 3, 77–119 (1988)
Kelner, J.A., Nikolova, E.: On the hardness and smoothed complexity of quasi-concave minimization. In: Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2007), pp. 472–482 (2007)
Megiddo, N.: Combinatorial optimization with rational objective functions. In: Proceedings of the 10th annual ACM symposium on Theory of computing (STOC 1978), New York, NY, USA, pp. 1–12 (1978)
Nikolova, E., Kelner, J.A., Brand, M., Mitzenmacher, M.: Stochastic Shortest Paths Via Quasi-convex Maximization. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 552–563. Springer, Heidelberg (2006)
Shachnai, H., Tamir, T.: Handbook of Approximation Algorithms and Metaheuristics. In: Gonzalez, T.F. (ed.). Chapman and Hall/CRC Computer and Information Science Series (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nonner, T. (2012). Polynomial-Time Approximation Schemes for Shortest Path with Alternatives. In: Epstein, L., Ferragina, P. (eds) Algorithms – ESA 2012. ESA 2012. Lecture Notes in Computer Science, vol 7501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33090-2_65
Download citation
DOI: https://doi.org/10.1007/978-3-642-33090-2_65
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33089-6
Online ISBN: 978-3-642-33090-2
eBook Packages: Computer ScienceComputer Science (R0)