In this paper, we propose a new method for partitioning a graph into an unspecified number of Hamiltonian subgraphs with minimum and maximum size requirements on the subgraphs. We refer to this problem as the cardinality constrained covering traveling salesman problem (CCC-TSP). Special cases of...

Geographical Information Systems (GIS) involve the manipulation of large spatial data sets, and the performance of these systems is often determined by how these data sets are organized on secondary storage (disk). This paper describes a simulation study investigating the performance of two...