Results 1 
4 of
4
An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree
, 1994
"... We address the question of theoretical vs. practical behavior of algorithms for the minimum spanning tree problem. We review the factors that influence the actual running time of an algorithm, from choice of language, machine, and compiler, through lowlevel implementation choices, to purely algorit ..."
Abstract

Cited by 43 (3 self)
 Add to MetaCart
We address the question of theoretical vs. practical behavior of algorithms for the minimum spanning tree problem. We review the factors that influence the actual running time of an algorithm, from choice of language, machine, and compiler, through lowlevel implementation choices, to purely algorithmic issues. We discuss how to design a careful experimental comparison between various alternatives. Finally, we present the results from a study in which we used: multiple languages, compilers, and machines; all the major variants of the comparisonbased algorithms; and eight varieties of graphs in five families, with sizes of up to 0.5 million vertices (in sparse graphs) or 1.3 million edges (in dense graphs).
Algorithms for the Online Travelling Salesman
 ALGORITHMICA
, 2001
"... In this paper the problem of efficiently serving a sequence of requests presented in an online fashion located at points of a metric space is considered. We call this problem the OnLine Travelling Salesman Problem (OLTSP). It has a variety of relevant applications in logistics and robotics. We ..."
Abstract

Cited by 32 (8 self)
 Add to MetaCart
In this paper the problem of efficiently serving a sequence of requests presented in an online fashion located at points of a metric space is considered. We call this problem the OnLine Travelling Salesman Problem (OLTSP). It has a variety of relevant applications in logistics and robotics. We consider two
A Polynomial Algorithm for a Constrained Travelling Salesman Problem
"... Abstract We give a polynomialtime algorithm for finding a solution to the Travelling Salesman Problem when the points given are constrained to lie on a fixed set of smooth curves of finite length. ..."
Abstract
 Add to MetaCart
(Show Context)
Abstract We give a polynomialtime algorithm for finding a solution to the Travelling Salesman Problem when the points given are constrained to lie on a fixed set of smooth curves of finite length.