28 citations · 62 across the 18 of their papers we have counts for
Showing 2014Show all
2 papers · 1 filter
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★ 6 cited
Improved Approximation Algorithms for Box Contact Representations
Michael A. Bekos, Thomas C. van Dijk, Martin Fink +5
We study the following geometric representation problem: Given a graph whose vertices correspond to axis-aligned rectangles with fixed dimensions, arrange the rectangles without ov…