Results 1 
3 of
3
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 40 (4 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).
Network Routing Models Applied To Aircraft Routing Problems
 In Proc. Winter Simulation Conf
, 1995
"... We study network models applied to two aircraft routing problems, one in which the goal is to route strike aircraft to a target and back so as to minimize losses and one in which the goal is to route civilian traffic around an airport so as to minimize noise exposure to the population. We propose jo ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
We study network models applied to two aircraft routing problems, one in which the goal is to route strike aircraft to a target and back so as to minimize losses and one in which the goal is to route civilian traffic around an airport so as to minimize noise exposure to the population. We propose joint routing as our model: find a required number of timedisjoint routes in a network that minimizes the total cost. We show that joint routing can in turn be modelled as a dynamic network flow problem. We study this problem under several variants and on different types of networks, establishing tight bounds on the running time of exact solutions through applications of both existing and some new methods. We also discuss the modelling of the airspace in which the routing takes place and how choices affect the performance of our optimization algorithms. Our model extends to other applications, such as the routing of hazardous materials and of secure communications. 1 INTRODUCTION Aircraft r...
Joint Routing in Networks
, 1993
"... Joint routing of objects through a network consists of finding a set of timedisjoint routes for the objects that maximize the number of objects routed from the source(s) to the sink(s) and minimize the total cost. We show that maximizing the number of objects sent along timedisjoint routes can be ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Joint routing of objects through a network consists of finding a set of timedisjoint routes for the objects that maximize the number of objects routed from the source(s) to the sink(s) and minimize the total cost. We show that maximizing the number of objects sent along timedisjoint routes can be modelled as a dynamic network flow problem. We study both this problem and its minimum cost version under several variants and on different types of networks, establishing tight bounds on the running time of exact solutions through applications of existing and some new methods. 1 Introduction Joint routing is the problem of generating jointly optimal routes through a network for vehicles or other mobile objects. Applications include mission planning, scheduling of flight corridors, design of transport routes for hazardous materials, and also communications within a network. Parameters and constraints may include edge lengths and costs, edge or node capacities, time windows (all objects mus...