2 citations · 2 across the 6 of their papers we have counts for
6 papers
An Improved Proximity Bound for Bike-Dock Reallocation Problem in Bike Sharing System
Akiyoshi Shioura
We consider a class of nonlinear integer programming problems arising from re-allocation of dock-capacity in a bike sharing system. The main aim of this note is to derive an improv…
Note on Steepest Descent Algorithm for Quasi L-convex Function Minimization
Kazuo Murota, Akiyoshi Shioura
We define a class of discrete quasi convex functions, called semi-strictly quasi L-convex functions, and show that the steepest descent algorithm for L-co…
Note on Minimization of Quasi M-convex Functions
Kazuo Murota, Akiyoshi Shioura
For a class of discrete quasi convex functions called semi-strictly quasi M-convex functions, we investigate fundamental issues relating to minimization, such as optimal…
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…
On Equivalence of M-concavity of a Set Function and Submodularity of Its Conjugate
Kazuo Murota, Akiyoshi Shioura
A fundamental theorem in discrete convex analysis states that a set function is M-concave if and only if its conjugate function is submodular. This paper gives a new pro…
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…