54 citations · 123 across the 39 of their papers we have counts for
7 papers · 1 filter
Horospherically convex optimization for fractional subspace packing and its applications
Hiroshi Hirai
In this paper, we address a semi-infinite LP relaxation of the vector-subspace packing problem. This is a higher-dimensional generalization of the fractional linear matroid parity…
Finding Hall blockers by matrix scaling
Koyo Hayashi, Hiroshi Hirai, Keiya Sakabe
For a given nonnegative matrix , the matrix scaling problem asks whether can be scaled to a doubly stochastic matrix for some positive diagonal matrices $…
Node-Connectivity Terminal Backup, Separately-Capacitated Multiflow, and Discrete Convexity
Hiroshi Hirai, Motoki Ikeda
The terminal backup problems (Anshelevich and Karagiozova (2011)) form a class of network design problems: Given an undirected graph with a requirement on terminals, the goal is to…
A cost-scaling algorithm for computing the degree of determinants
Hiroshi Hirai, Motoki Ikeda
In this paper, we address computation of the degree of Dieudonné determinant of \[ A = \sum_{k=1}^m A_k x_k t^{c_k}, \] where ar…
A Cost-Scaling Algorithm for Minimum-Cost Node-Capacitated Multiflow Problem
Hiroshi Hirai, Motoki Ikeda
In this paper, we address the minimum-cost node-capacitated multiflow problem in an undirected network. For this problem, Babenko and Karzanov (2012) showed strongly polynomial-tim…
On a weighted linear matroid intersection algorithm by deg-det computation
Hiroki Furue, Hiroshi Hirai
In this paper, we address the weighted linear matroid intersection problem from the computation of the degree of the determinants of a symbolic matrix. We show that a generic algor…
A dual descent algorithm for node-capacitated multiflow problems and its applications
Hiroshi Hirai
In this paper, we develop an -time algorithm to find a half-integral node-capacitated multiflow of the maximum total flow-value in a network with $…