|
493
|
Fibonacci heaps and their uses in improved network optimization algorithms
– M L Fredman, R E Tarjan
- 1987
|
|
20
|
An Empirical Analysis of Algorithms for Constructing a Minimum Spanning Tree
– Bernard M. E. Moret, Henry D. Shapiro
- 1991
|
|
47
|
The pairing heap: A new form of self-adjusting heap
– M L Fredman, R Sedgewick, D D Sleator, R E Tarjan
- 1986
|
|
321
|
On the shortest spanning subtree of a graph and the traveling salesman problem
– J Kruskal
- 1956
|
|
1
|
On two discrete optimization problems
– S E Gvozdev
- 1979
|
|
1
|
The Traveling Salesman Problem: Part 1, Theoretical Issues", Automation and Remote Control 50
– Sigal
- 1989
|
|
1
|
On the minimum spanning tree problem with restrictions
– S A Morozov
- 1976
|
|
2
|
Approximation of Pareto optima in multi-objective, shortest path problems
– A Warburton
- 1987
|
|
128
|
Approximation schemes for the restricted shortest path problem
– R Hassin
- 1992
|
|
16
|
Shortest chain subject to side constraints
– Y P Aneja, V Aggarwal, K P K Nair
- 1983
|
|
20
|
The shortest route problem with constraints
– H C Joksch
- 1966
|
|
55
|
The network inhibition problem, in
– C A Phillips
- 1993
|
|
47
|
A dual algorithm for the constrained shortest path problem
– G Y Handler, I Zang
- 1980
|
|
18
|
The shortest path problem with two objective functions
– M I Henig
- 1985
|
|
8882
|
Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H
– M R Garey, D S Johnson
- 1979
|
|
75
|
Operation Research, an introduction
– A H Taha
- 1992
|
|
4
|
A general technique for implementation of efficient priority queues
– Peter Hyer
- 1995
|
|
9
|
Fast Meldable Priority Queues
– Gerth Stølting Brodal, Gerth Stlting Brodal
- 1995
|
|
12
|
Three priority queue applications revisited
– A M Liao
- 1992
|
