3 citations · 4 across the 6 of their papers we have counts for
8 papers
Minsum -Sink Problem on Path Networks
Robert Benkoczi, Binay Bhattacharya, Yuya Higashikawa +2
We consider the problem of locating a set of sinks on a path network with general edge capacities that minimizes the sum of the evacuation times of all evacuees. We first prese…
Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks
Binay Bhattacharya, Yuya Higashikawa, Tsunehiko Kameda +1
Evacuation in emergency situations can be modeled by a dynamic flow network. Two criteria have been used before: one is the evacuation completion time and the other is the aggregat…
Improved Algorithms for Computing -Sink on Dynamic Path Networks
Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa +2
We present a novel approach to finding the -sink on dynamic path networks with general edge capacities. Our first algorithm runs in time, where …
The -Center Problem in Tree Networks Revisited
Aritra Banik, Binay Bhattacharya, Sandip Das +2
We present two improved algorithms for weighted discrete -center problem for tree networks with vertices. One of our proposed algorithms runs in $O(n \log n + p \log^2 n \lo…
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…