An approximation algorithm for network design problems with downwards-monotone demand functions
Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorithm that produces solutions that are at least as good as and typically better than solutions produced by the existing algorithm.
KeywordsNetwork design problems Approximation algorithms Spanning forests Integer programs
Unable to display preview. Download preview PDF.
- 1.Bar-Yehuda, R., Keren, B., Freund, A., Rawitz, D.: Local ratio: a unified framework for approximation algorithms. In memoriam: Shimon Even 1935–2004. ACM Comput. Surv. (CSUR), 36(4), 422–463, (2004)Google Scholar
- 2.Corman T., Leiserson C., Rivest R. and Stein C. (2001). Introduction to algorithms 2nd edn. MIT Press, Cambridge Google Scholar
- 3.Goemans, M.X., Williamson, D.P.: The primal-dual method for approximation algorithms and its application to network design problems. In: Hochbaum, D. (ed.) Approximation Algorithms, pp. 144–191 (1997)Google Scholar