701 search results - page 141 / 141 » An Ant Algorithm for the Steiner Tree Problem in Graphs |
JACM
2000
13 years 5 months ago
2000
A simple variant of a priority queue, called a soft heap, is introduced. The data structure supports the usual operations: insert, delete, meld, and findmin. Its novelty is to beat...