35 citations · 75 across the 13 of their papers we have counts for
Showing 2014 · cs.DSShow all
2 papers · 2 filters
cs.DS2014★ 2 cited
Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
Stefan Hougardy, Jannik Silvanus, Jens Vygen
We present a new exact algorithm for the Steiner tree problem in edge-weighted graphs. Our algorithm improves the classical dynamic programming approach by Dreyfus and Wagner. We a…
cs.DS2014
On the Nearest Neighbor Rule for the Metric Traveling Salesman Problem
Stefan Hougardy, Mirko Wilde
We present a very simple family of traveling salesman instances with cities where the nearest neighbor rule may produce a tour that is times longer than an optimum…