DeepAI AI Chat
Log In Sign Up

Minsum k-Sink Problem on Path Networks

by   Robert Benkoczi, et al.

We consider the problem of locating a set of k sinks on a path network with general edge capacities that minimizes the sum of the evacuation times of all evacuees. We first present an O(kn^4n) time algorithm when the edge capacities are non-uniform, where n is the number of vertices. We then present an O(kn^3 n) time algorithm when the edge capacities are uniform. We also present an O(n n) time algorithm for the special case where k=1 and the edge capacities are non-uniform.


page 1

page 2

page 3

page 4


Quantum Algorithm for the Longest Trail Problem

We present the quantum algorithm for the Longest Trail Problem. The prob...

Convergence of the Non-Uniform Physarum Dynamics

Let c ∈Z^m_> 0, A ∈Z^n× m, and b ∈Z^n. We show under fairly general cond...

Reinforcement Learning with Non-uniform State Representations for Adaptive Search

Efficient spatial exploration is a key aspect of search and rescue. In t...

On Certifying Non-uniform Bound against Adversarial Attacks

This work studies the robustness certification problem of neural network...

Decision times of infinite computations

The decision time of an infinite time algorithm is the supremum of its h...

Minmax Regret 1-Sink for Aggregate Evacuation Time on Path Networks

Evacuation in emergency situations can be modeled by a dynamic flow netw...

Optimal Non-Uniform Deployments of LoRa Networks

LoRa wireless technology is an increasingly prominent solution for massi...