@inproceedings{85e2e5cbc70e4c2f8067286e6beb28cd,
title = "Minimax regret k-sink location problem in dynamic path networks",
abstract = "Recently, Cheng et al. [1] proposed the minimax regret 1-sink location problem in dynamic path networks and presented an O(nlog2 n) time algorithm for the proposed problem, where n is the number of vertices. In this paper, we study the general problem, i.e., minimax regret k-sink location problem in the dynamic path networks. Based on the algorithm for the 1-sink location problem, we design an O(n2(log n)1+log kC nk-1) time algorithm for the general problem, where C nk-1 is the number of combination choosing k - 1 from n.",
keywords = "dynamic flow, evacuation problem, k-sink location, minimax regret, path networks",
author = "Guanqun Ni and Yinfeng Xu and Yucheng Dong",
year = "2014",
doi = "10.1007/978-3-319-07956-1\_3",
language = "英语",
isbn = "9783319079554",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "23--31",
booktitle = "Algorithmic Aspects in Information and Management - 10th International Conference, AAIM 2014, Proceedings",
note = "10th International Conference on Algorithmic Aspects of Information and Management, AAIM 2014 ; Conference date: 08-07-2014 Through 11-07-2014",
}