7 citations · 31 across the 24 of their papers we have counts for
Showing 2014 · cs.DSShow all
3 papers · 2 filters
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.DS2014
Strong Steiner Tree Approximations in Practice
Stephan Beyer, Markus Chimani
In this experimental study we consider Steiner tree approximations that guarantee a constant approximation of ratio smaller than . The considered greedy algorithms and approache…
cs.DS2014
Advances on Testing C-Planarity of Embedded Flat Clustered Graphs
Markus Chimani, Giuseppe Di Battista, Fabrizio Frati +1
We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.