T. Kameda

activity

20152018

most citedThe

p

-Center Problem in Tree Networks Revisited

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

collaborators

Showing 2016Show all

2 papers · 1 filter

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.DS2016★ 3 cited

The $p$ -Center Problem in Tree Networks Revisited

Aritra Banik, Binay Bhattacharya, Sandip Das +2

We present two improved algorithms for weighted discrete $p$ -center problem for tree networks with $n$ vertices. One of our proposed algorithms runs in $O(n \log n + p \log^2 n \lo…

Improved Algorithms for Computing k-Sink on Dynamic Path Networks

The p-Center Problem in Tree Networks Revisited

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

The $p$ -Center Problem in Tree Networks Revisited