Highly Influenced

# Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity

@inproceedings{Higashikawa2014MinimaxRS, title={Minimax Regret Sink Location Problem in Dynamic Tree Networks with Uniform Capacity}, author={Yuya Higashikawa and Mordecai J. Golin and Naoki Katoh}, booktitle={WALCOM}, year={2014} }

- Published 2014 in WALCOM
DOI:10.1007/978-3-319-04657-0_14

This paper addresses the minimax regret sink location problem in dynamic tree networks. In our model, a dynamic tree network consists of an undirected tree with positive edge lengths and uniform edge capacity, and the vertex supply which is a positive value is unknown but only the interval of supply is known. A particular realization of supply to each vertex is called a scenario. Under any scenario, the cost of a sink location x is defined as the minimum time to complete the evacuation to x for… CONTINUE READING