Binay Bhattacharya

activity

20142023

most citedFacility location problems in the constant work-space read-only memory model

1 citations · 1 across the 3 of their papers we have counts for

collaborators

Showing cs.DSShow all

3 papers · 1 filter

cs.DS2023

A Subquadratic Time Algorithm for the Weighted $k$ -Center Problem on Cactus Graphs

Binay Bhattacharya, Sandip Das, Subhadeep Ranjan Dev

The weighted $k$ -center problem in graphs is a classical facility location problem where we place $k$ centers on the graph, which minimize the maximum weighted distance of a vertex…

cs.DS2016

Improved Algorithms for Computing $k$ -Sink on Dynamic Path Networks

Binay Bhattacharya, Mordecai J. Golin, Yuya Higashikawa +2

We present a novel approach to finding the $k$ -sink on dynamic path networks with general edge capacities. Our first algorithm runs in $O (n lo g n + k^{2} lo g^{4} n)$ time, where $n$ …

cs.DS2014★ 1 cited

Facility location problems in the constant work-space read-only memory model

Binay K. Bhattacharya, Minati De, Subhas C. Nandy +1

Facility location problems are captivating both from theoretical and practical point of view. In this paper, we study some fundamental facility location problems from the space-eff…

A Subquadratic Time Algorithm for the Weighted k-Center Problem on Cactus Graphs

Improved Algorithms for Computing k-Sink on Dynamic Path Networks

Facility location problems in the constant work-space read-only memory model

A Subquadratic Time Algorithm for the Weighted $k$ -Center Problem on Cactus Graphs

Improved Algorithms for Computing $k$ -Sink on Dynamic Path Networks