Shioura Akiyoshi

Akiyoshi Shioura

Information about the author Akiyoshi Shioura will soon be added to the site.
Found 7 papers in total
Note on the continuity of M-convex and L-convex functions in continuous variables
Note on the continuity of M-convex and L-convex functions in continuous variables
2008
M–convex and L–convex functions in continuous variables constitute...
On Hochbaum's proximity-scaling algorithm for the general resource allocation problem
On Hochbaum's proximity-scaling algorithm for the general resource allocation problem
2004
It is pointed out that the polynomial-time scaling algorithm by Hochbaum does not work...
Efficient strategy proof fair allocation algorithms
Efficient strategy proof fair allocation algorithms
2006
We study a fair division problem with indivisible objects like jobs, houses, and one...
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
The MA-ordering max-flow algorithm is not strongly polynomial for directed networks
2004
Quite recently Fujishige developed a weakly polynomial-time algorithm for the maximum...
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
Minimum ratio canceling is oracle polynomial for linear programming, but not strongly polynomial, even for networks
2000
This paper shows that the minimum ratio canceling algorithm of Wallacher (and a faster...
The tree center problems and the relationship with the bottleneck knapsack problems
The tree center problems and the relationship with the bottleneck knapsack problems
1997
The tree center problems are designed to find a subtree minimizing the maximum...
Efficiently scanning all spanning trees of an undirected graph
Efficiently scanning all spanning trees of an undirected graph
1995
Let G be an undirected graph with V vertices and E edges. The authors consider the...
Papers per page: