28 citations · 62 across the 18 of their papers we have counts for
Showing 2010Show all
2 papers · 1 filter
cs.DS2010
Maximum Betweenness Centrality: Approximability and Tractable Cases
Martin Fink, Joachim Spoerhase
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a -element node set that maximizes the probability of detecting communication…
cs.DS2010★ 1 cited
An Optimal Algorithm for the Indirect Covering Subtree Problem
Joachim Spoerhase
We consider the indirect covering subtree problem (Kim et al., 1996). The input is an edge weighted tree graph along with customers located at the nodes. Each customer is associate…