17 citations · 33 across the 4 of their papers we have counts for
4 papers
Complexity of MLDP
Nancy A. Arellano-Arriaga, Julián Molina, Satu Elisa Schaeffer +2
We carry out an explicit examination of the NP-hardness of a bi- objective optimization problem to minimize distance and latency of a single-vehicle route designed to serve a set o…
Locally computable approximations for spectral clustering and absorption times of random walks
Pekka Orponen, Satu Elisa Schaeffer, Vanesa Avalos Gaytán
We address the problem of determining a natural local neighbourhood or "cluster" associated to a given seed vertex in an undirected graph. We formulate the task in terms of absorpt…
On the NP-Completeness of Some Graph Cluster Measures
Jiri Sima, Satu Elisa Schaeffer
Graph clustering is the problem of identifying sparsely connected dense subgraphs (clusters) in a given graph. Proposed clustering algorithms usually optimize various fitness funct…
Efficient Algorithms for Sampling and Clustering of Large Nonuniform Networks
Pekka Orponen, Satu Elisa Schaeffer
We propose efficient algorithms for two key tasks in the analysis of large nonuniform networks: uniform node sampling and cluster detection. Our sampling technique is based on augm…