5 citations · 6 across the 3 of their papers we have counts for
3 papers
cs.DS2014★ 5 cited
Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees
Markus Chimani, Joachim Spoerhase
In a directed graph with non-correlated edge lengths and costs, the \emph{network design problem with bounded distances} asks for a cost-minimal spanning subgraph subject to a…
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…