Nov 20, 2015 · In this paper we consider the minmax regret 1-center problem, in which only the vertex weights are uncertain. This problem is understood as ...
Apr 21, 2019 · We first give an time algorithm for the path networks, and then present an time algorithm for the tree networks, which improves upon the ...
We also present an O ( n log n ) time algorithm for the unicycle networks, which contain just one cycle. Our cactus algorithm runs in O ( n log 2 n ) time.
We first give an O(n) time algorithm for the path networks, and then present an O(nlogn) time algorithm for the tree networks, which improves upon the ...
Abstract—In a facility location problem in computational geometry, if the vertex weights are uncertain one may look for a “robust” solution that minimizes ...
Missing: unicycle/ | Show results with:unicycle/
Our tree algorithm presents an improvement over the previously known algorithms that run in O(nlog 2 n) time. There is no previously published result tailored ...
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks. Bhattacharya, B.; Kameda, T.; Song, Z. Discrete Applied Mathematics 195: 18-30.
This paper studies the problem of finding a path center on a tree in which vertex weights are uncertain and the uncertainty is described by given intervals.
Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks. Binay Bhattacharya, Tsunehiko Kameda, Zhao Song.
... Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks. Discrete Appl. Math. 195, 18–30 (2015) https://doi.org/10.1016/j.dam.2014.10.022 ...