34 citations · 47 across the 5 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2012★ 9 cited
Polylogarithmic Approximation for Generalized Minimum Manhattan Networks
Aparna Das, Krzysztof Fleszar, Stephen Kobourov +3
Given a set of terminals, which are points in -dimensional Euclidean space, the minimum Manhattan network problem (MMN) asks for a minimum-length rectilinear network that co…
cs.CG2011★ 4 cited
Approximating Minimum Manhattan Networks in Higher Dimensions
Aparna Das, Emden R. Gansner, Michael Kaufmann +3
We study the minimum Manhattan network problem, which is defined as follows. Given a set of points called \emph{terminals} in , find a minimum-length network such that each p…