Author:
Du Ding-Zhu,Pardalos Panos,Hu Xiaodong,Wu Weili
Publisher
Springer International Publishing
Reference27 articles.
1. C. Ambühl, T. Erlebach, M. Mihalák and M. Nunkesser: Constant-approximation for minimum-weight (connected) dominating sets in unit disk graphs, Proceedings, 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2006), Springer LNCS 4110: 3–14 (2006).
2. R. Bellman: On a routing problem, Quarterly of Applied Mathematics, 16: 87–90 (1958).
3. Al Borchers and Prosenjit Gupta: Extending the Quadrangle Inequality to Speed-Up Dynamic Programming. Inf. Process. Lett., 49(6): 287–290 (1994).
4. Robert B. Dial: Algorithm 360: Shortest-Path Forest with Topological Ordering [H], Communications of the ACM, 12 (11): 632–633 (1969).
5. E.W. Dijkstra: A note on two problems in connexion with graphs, Numerische Mathematik, 1: 269–271 (1959).