3 citations · 7 across the 9 of their papers we have counts for
13 papers
A Subquadratic Time Algorithm for the Weighted -Center Problem on Cactus Graphs
Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev
The weighted -center problem in graphs is a classical facility location problem where we place centers on the graph, which minimize the maximum weighted distance of a vertex…
An Efficient Algorithm for the Proximity Connected Two Center Problem
Binay Bhattacharya, Amirhossein Mozafari, Thomas C. Shermer
Given a set of points in the plane, the -center problem is to find congruent disks of minimum possible radius such that their union covers all the points in . The…
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…
Bilinear Assignment Problem: Large Neighborhoods and Experimental Analysis of Algorithms
Vladyslav Sokol, Ante Ćustić, Abraham P. Punnen +1
The bilinear assignment problem (BAP) is a generalization of the well-known quadratic assignment problem (QAP). In this paper, we study the problem from the computational analysis…
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 …