Many Connected Components

This chapter presents different ways of handling the first challenge of summarizing spatial network data, i.e., the large number of k-subsets of connected components in the network. This challenge is conceptualized as the spatial network activity summarization problem (SNAS) where given a spatial network, a collection of activities and their locations (e.g., placed on a node or an edge), and a desired number of paths k, SNAS finds a set of k shortest paths that maximizes the sum of activities on the paths (counting activities that are on overlapping paths only once) and a partitioning of activities across the paths.