2 papers
math.OC2018
M-convex Function Minimization Under L1-Distance Constraint
Akiyoshi Shioura
In this paper we consider a new problem of minimizing an M-convex function under L1-distance constraint (MML1); the constraint is given by an upper bound for L1-distance between a…
cs.CG2016
Colored Spanning Graphs for Set Visualization
Ferran Hurtado, Matias Korman, Marc van Kreveld +6
We study an algorithmic problem that is motivated by ink minimization for sparse set visualizations. Our input is a set of points in the plane which are either blue, red, or purple…