Yuya Higashikawa

activity

20142023

most citedPolynomial-time approximability of the k-Sink Location problem

6 citations · 17 across the 13 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★ 4 cited

Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities

Guru Prakash Arumugam, John Augustine, Mordecai J. Golin +3

A Dynamic Graph Network is a graph in which each edge has an associated travel time and a capacity (width) that limits the number of items that can travel in parallel along that ed…

Improved Algorithms for Computing k-Sink on Dynamic Path Networks

Optimal Evacuation Flows on Dynamic Paths with General Edge Capacities

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