3 citations · 4 across the 6 of their papers we have counts for
4 papers · 1 filter
Improved Algorithms for Exact and Approximate Boolean Matrix Decomposition
Yuan Sun, Shiwei Ye, Yi Sun +1
An arbitrary Boolean matrix can be decomposed {\em exactly} as , where (resp. ) is an (resp. ) Boolean matrix and …
Linear-Time Fitting of a -Step Function
Binay Bhattacharya, Sandip Das, Tsunehiko Kameda
Given a set of weighted points on the - plane, we want to find a step function consisting of horizontal steps such that the maximum vertical weighted distance from an…
Geometric k-Center Problems with Centers Constrained to Two Lines
Binay Bhattacharya, Sandip Das, Yuya Higashikawa +2
We consider the -center problem in which the centers are constrained to lie on two lines. Given a set of weighted points in the plane, we want to locate up to centers on…
Minimax Regret 1-Median Problem in Dynamic Path Networks
Yuya Higashikawa, Siu-Wing Cheng, Tsunehiko Kameda +2
This paper considers the minimax regret 1-median problem in dynamic path networks. In our model, we are given a dynamic path network consisting of an undirected path with positive…