Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algorithmic problems, namely low-congestion routing in networks and max-coverage problems in hypergraphs. Based on our experiments, we also propose and investigate the following new ideas. For the low-congestion routing problems, we suggest to solve a second LP, which yields the same congestion, but aims at producing a solution that is easier to round. For the max-coverage instances, observing that the greedy heuristic also performs very good, we develop hybrid approaches, in the form of a strengthened method of derandomized rounding, and a simple greedy/rounding hybrid using greedy and LP-based rounding elements. Experiments show that these ideas significantly reduce the rounding errors.
For an important special case of max-coverage, namely unit disk max-domination, we also develop a PTAS. However, experiments show it less competitive than other approaches, except possibly for extremely high solution qualities.
Unable to display preview. Download preview PDF.
- 5.Doerr, B., Wahlström, M.: Randomized rounding in the presence of a cardinality constraint. In: ALENEX 2009, pp. 162–174 (2009)Google Scholar
- 6.Gandhi, R., Khuller, S., Parthasarathy, S., Srinivasan, A.: Dependent rounding in bipartite graphs. In: FOCS 2002, pp. 323–332 (2002)Google Scholar
- 11.Kleinberg, J.: Approximation Algorithms for Disjoint Paths Problems. PhD thesis, MIT (1996)Google Scholar
- 12.Kochetov, Y., Ivanenko, D.: Computationally difficult instances for the uncapacitated facility location problem. In: Proc. of the 5th Metaheuristic Conf., MIC 2003 (2003)Google Scholar
- 14.L.A.N.Lorena-instancias, http://www.lac.inpe.br/~lorena/instancias.html
- 15.Masuyama, S., Ibaraki, T., Hasegawa, T.: Computational complexity of the m-center problems on the plane. Trans. of the Inst. of Electron. and Commun. Eng. of Japan. Sect. E 64, 57–64 (1981)Google Scholar
- 20.Srinivasan, A.: Distributions on level-sets with applications to approximations algorithms. In: FOCS 2001, pp. 588–597 (2001)Google Scholar