12 citations · 13 across the 3 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2020
Dynamic Programming Approach to the Generalized Minimum Manhattan Network Problem
Yuya Masumura, Taihei Oki, Yutaro Yamaguchi
We study the generalized minimum Manhattan network (GMMN) problem: given a set of pairs of two points in the Euclidean plane , we are required to find a minimum-l…
cs.DS2019
Pfaffian Pairs and Parities: Counting on Linear Matroid Intersection and Parity Problems
Kazuki Matoya, Taihei Oki
Spanning trees are a representative example of linear matroid bases that are efficiently countable. Perfect matchings of Pfaffian bipartite graphs are a countable example of common…
cs.DS2019
Computing Valuations of the Dieudonné Determinants
Taihei Oki
This paper addresses the problem of computing valuations of the Dieudonné determinants of matrices over discrete valuation skew fields (DVSFs). Under a reasonable computational mod…