17 citations · 33 across the 4 of their papers we have counts for
Showing cs.CCShow all
2 papers · 1 filter
cs.CC2018
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…
cs.CC2005★ 17 cited
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…