Funder
Grantová Agentura Ceské Republiky
Univerzita Karlova v Praze
Deutsche Forschungsgemeinschaft
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference56 articles.
1. Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.: VC-dimension and shortest path algorithms. In: Proceedings of 28th International Colloquium on Automata, Languages, and Programming (ICALP), pp. 690–699 (2011). https://doi.org/10.1007/978-3-642-22006-7_58
2. Abraham, I., Delling, D., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway dimension and provably efficient shortest path algorithms. J. ACM (2016). https://doi.org/10.1145/2985473
3. Abraham, I., Fiat, A., Goldberg, A.V., Werneck, R.F.: Highway dimension, shortest paths, and provably efficient algorithms. In: Proceedings of 21st Annual ACM-SIAM Symposium Discrete Algorithms (SODA), pp. 782–793 (2010). https://doi.org/10.1137/1.9781611973075.64
4. Arora, S.: Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems. J. ACM 45(5), 753–782 (1998). https://doi.org/10.1145/290179.290180
5. Arora, S., Grigni, M., Karger, D.R., Klein, P.N., Woloszyn, A.: A polynomial-time approximation scheme for weighted planar graph TSP. In: Proceedings of 9th Annual ACM-SIAM Symposium Discrete Algorithms (SODA), pp. 33–41 (1998)