{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T09:34:10Z","timestamp":1725701650166},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642330896"},{"type":"electronic","value":"9783642330902"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33090-2_65","type":"book-chapter","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T15:29:11Z","timestamp":1346167751000},"page":"755-765","source":"Crossref","is-referenced-by-count":3,"title":["Polynomial-Time Approximation Schemes for Shortest Path with Alternatives"],"prefix":"10.1007","author":[{"given":"Tim","family":"Nonner","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"65_CR1","doi-asserted-by":"publisher","first-page":"580","DOI":"10.1287\/moor.16.3.580","volume":"16","author":"D.P. Bertsekas","year":"1991","unstructured":"Bertsekas, D.P., Tsitsiklis, J.N.: An analysis of stochastic shortest path problems. Math. Oper. Res.\u00a016, 580\u2013595 (1991)","journal-title":"Math. Oper. Res."},{"issue":"5","key":"65_CR2","doi-asserted-by":"publisher","first-page":"336","DOI":"10.1016\/S0167-6377(02)00157-8","volume":"30","author":"A. Billionnet","year":"2002","unstructured":"Billionnet, A.: Approximation algorithms for fractional knapsack problems. Operations Research Letters\u00a030(5), 336\u2013342 (2002)","journal-title":"Operations Research Letters"},{"key":"65_CR3","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L.: Introduction to Algorithms. MIT Press (1990)"},{"key":"65_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s10107-010-0364-8","volume":"124","author":"J. Correa","year":"2010","unstructured":"Correa, J., Fernandes, C., Wakabayashi, Y.: Approximating a class of combinatorial problems with rational objective function. Mathematical Programming\u00a0124, 255\u2013269 (2010)","journal-title":"Mathematical Programming"},{"key":"65_CR5","doi-asserted-by":"crossref","unstructured":"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\u2013398 (1998)","DOI":"10.1145\/276698.276792"},{"issue":"3","key":"65_CR6","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1287\/opre.17.3.395","volume":"17","author":"S.E. Dreyfus","year":"1969","unstructured":"Dreyfus, S.E.: An appraisal of some shortest-path algorithms. Operations Research\u00a017(3), 395\u2013412 (1969)","journal-title":"Operations Research"},{"key":"65_CR7","unstructured":"Dynkin, E.B.: The optimum choice of the instant for stopping a Markov process. Soviet Math. Dokl.\u00a04 (1963)"},{"key":"65_CR8","doi-asserted-by":"crossref","unstructured":"Ford, L., Fulkerson, D.: Flows in Networks. Princeton University Press (1962)","DOI":"10.1515\/9781400875184"},{"key":"65_CR9","doi-asserted-by":"crossref","unstructured":"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\u2013341 (2011)","DOI":"10.1137\/1.9781611973082.27"},{"key":"65_CR10","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF02591737","volume":"37","author":"S. Hashizume","year":"1987","unstructured":"Hashizume, S., Fukushima, M., Katoh, N., Ibaraki, T.: Approximation algorithms for combinatorial fractional programming problems. Mathematical Programming\u00a037, 255\u2013267 (1987)","journal-title":"Mathematical Programming"},{"key":"65_CR11","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/BF01762111","volume":"3","author":"A.R. Karlin","year":"1988","unstructured":"Karlin, A.R., Manasse, M.S., Rudolph, L., Sleator, D.D.: Competitive snoopy caching. Algorithmica\u00a03, 77\u2013119 (1988)","journal-title":"Algorithmica"},{"key":"65_CR12","doi-asserted-by":"crossref","unstructured":"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\u2013482 (2007)","DOI":"10.1109\/FOCS.2007.68"},{"key":"65_CR13","doi-asserted-by":"crossref","unstructured":"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\u201312 (1978)","DOI":"10.1145\/800133.804326"},{"key":"65_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"552","DOI":"10.1007\/11841036_50","volume-title":"Algorithms \u2013 ESA 2006","author":"E. Nikolova","year":"2006","unstructured":"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.\u00a04168, pp. 552\u2013563. Springer, Heidelberg (2006)"},{"key":"65_CR15","unstructured":"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)"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33090-2_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:55:06Z","timestamp":1620129306000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33090-2_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642330896","9783642330902"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33090-2_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}