9 citations · 21 across the 18 of their papers we have counts for
Showing 2017 · math.OCShow all
3 papers · 2 filters
math.OC2017
On integer network synthesis problem with tree-metric cost
Hiroshi Hirai, Masashi Nitta
Network synthesis problem (NSP) is the problem of designing a minimum-cost network (from the empty network) satisfying a given connectivity requirement. Hau, Hirai, and Tsuchimura…
math.OC2017
Discrete Convex Functions on Graphs and Their Algorithmic Applications
Hiroshi Hirai
The present article is an exposition of a theory of discrete convex functions on certain graph structures, developed by the author in recent years. This theory is a spin-off of dis…
math.OC2017
Maximum vanishing subspace problem, CAT(0)-space relaxation, and block-triangularization of partitioned matrix
Masaki Hamada, Hiroshi Hirai
In this paper, we address the following algebraic generalization of the bipartite stable set problem. We are given a block-structured matrix (partitioned matrix) , wh…