Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles
In a facility location problem, if the vertex weights are uncertain one may look for a “robust” solution that minimizes “regret.” We present an O(nlogn) (resp. O(cnlogn)) time algorithm for a tree (resp. c-cycle cactus), where n is the number of vertices and c is a constant. Our tree algorithm presents an improvement over the previously known algorithms that run in O(nlog2 n) time. There is no previously published result tailored specifically for a cactus network. The best algorithm for a general network takes O(mn logn) time, where m is the number of edges.
KeywordsEdge Length Facility Location Problem Tree Network Vertex Weight Minimax Regret
Unable to display preview. Download preview PDF.
- 5.Benkoczi, R.: Cardinality constrained facility location problems in trees. Ph.D. thesis, School of Computing Science, Simon Fraser University, Canada (2004)Google Scholar
- 7.Bhattacharya, B., Kameda, T., Song, Z.: Minmax regret 1-center on a path/cycle/tree. In: Proc. 6th Int’l Conf. on Advanced Engineering Computing and Applications in Sciences (ADVCOMP), pp. 108–113 (2012), http://www.thinkmind.org/index.php?view=article&articleid=advcomp_2012_5_20_20093
- 15.Kouvelis, P., Vairaktarakis, G., Yu, G.: Robust 1-median location on a tree in the presence of demand and transportation cost uncertainty. Tech. Rep. Working Paper 93/94-3-4, Department of Management Science, The University of Texas, Austin (1993)Google Scholar