Noga Alon
Abstract
We study a wide range of online graph and network optimization problems, focusing on problems that arise in the study of connectivity and cuts in graphs. In a general online network design problem, we have a communication network known to the algorithm in advance. What is not known in advance are the connectivity (bandwidth) or cut demands between vertices in the network which arrive online.We develop a unified framework for designing online algorithms for problems involving connectivity and cuts. We first present a general O(log m)-competitive deterministic algorithm for generating a fractional solution that satisfies the online connectivity or cut demands, where m is the number of edges in the graph. This may be of independent interest for solving fractional online bandwidth allocation problems, and is applicable to both directed and undirected graphs. We then show how to obtain integral solutions via an online rounding of the fractional solution. This part of the framework is problem dependent, and applies various tools including results on approximate max-flow min-cut for multicommodity flow, the Hierarchically Separated Trees (HST) method and its extensions, certain rounding techniques for dependent variables, and Räcke's new hierarchical decomposition of graphs.Specifically, our results for the integral case include an O(log mlog n)-competitive randomized algorithm for the online nonmetric facility location problem and for a generalization of the problem called the multicast problem. In the nonmetric facility location problem, m is the number of facilities and n is the number of clients. The competitive ratio is nearly tight. We also present an O(log2nlog k)-competitive randomized algorithm for the online group Steiner problem in trees and an O(log3nlog k)-competitive randomized algorithm for the problem in general graphs, where n is the number of vertices in the graph and k is the number of groups. Finally, we design a deterministic O(log3nlog log n)-competitive algorithm for the online multi-cut problem.
- Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., and Naor, J. 2003. The online set cover problem. In Proceedings of the 35th Annual ACM Symposium on the Theory of Computation. ACM, New York, 100--105. Google Scholar
Digital Library
- Alon, N., and Spencer, J. H. 2000. The Probabilistic Method, 2nd Ed. Wiley, New York.Google Scholar
- Awerbuch, B., Azar, Y., and Bartal, Y. 2001. On-line generalized Steiner problem. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, 68--74. Google ScholarDigital Library
- Bartal, Y. 1996. Probabilistic approximation of metric spaces and its algorithmic applications. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 184--193. Google ScholarDigital Library
- Berman, P., and Coulston, C. 1997. On-line algorithms for Steiner tree problems. In Proceedings of the 29th Annual ACM Symposium on the Theory of Computation. 344--353. Google ScholarDigital Library
- Bienkowski, M., Korzeniowski, M., and Räcke, H. 2003. A practical algorithm for constructing oblivious routing schemes. In Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures. ACM, New York, 24--33. Google ScholarDigital Library
- Fotakis, D. 2003. On the competitive ratio for online facility location. In Proceedings of the 30th International Colloquium on Automata, Languages and Programming. 637--652. Google ScholarDigital Library
- Fakcharoenphol, J., Rao, S., and Talwar, K. 2003. A tight bound on approximating arbitrary metrics by tree metrics. In Proceedings of the 35th annual ACM Symposium on Theory of Computation. ACM, New York, 448--455. Google ScholarDigital Library
- Garg, N., Konjevod, G., and Ravi, R. 2003. A polylogarithmic approximation algorithm for the group Steiner tree problem. J. Algorithms 37, 66--84. Google ScholarDigital Library
- Garg, N., Vazirani, V. V., and Yannakakis, M. 1996. Approximate max-flow min-(multi)cut theorems and their applications. SIAM J. Comput. 25, 235--251. Google ScholarDigital Library
- Garg, N., Vazirani, V. V., and Yannakakis, M. 1997. Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18, 3--20.Google ScholarDigital Library
- Harrelson, C., Hidrum, K., and Rao, S. 2003. A polynomial time tree decomposition to minimize congestion. In Proceedings of the 15th ACM Symposium on Parallelism in Algorithms and Architectures. ACM, New York, 34--43. Google ScholarDigital Library
- Hochbaum, D. S. 1997. Approximation Algorithms. PWS Publishing Company. Google ScholarDigital Library
- Imase, M. and Waxman, B. M. 1991. Dynamic Steiner tree problem. SIAM J. Disc. Math 4, 369--384.Google ScholarCross Ref
- Meyerson, A. 2001. Online facility location. In Proceedings of the 42nd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 426--431. Google ScholarDigital Library
- Plotkin, S. A., Shmoys, D., and Tardos, E. 1995. Fast approximation algorithms for fractional packing and covering problems. Math. Oper. Res. 20, 257--301. Google ScholarDigital Library
- Räcke, H. 2002. Minimizing congestion in general networks. In Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, CA, 43--52. Google ScholarDigital Library
- Vazirani, V. V. 2001. Approximation Algorithms. Springer-Verlag, New York. Google ScholarDigital Library
Index Terms
- A general approach to online network optimization problems
Recommendations
The online set cover problem
STOC '03: Proceedings of the thirty-fifth annual ACM symposium on Theory of computingLet X=[1,2,•••,n] be a ground set of n elements, and let S be a family of subsets of X, |S|=m, with a positive cost cS associated with each S ∈ S.Consider the following online version of the set cover problem, described as a game between an algorithm ...
A general approach to online network optimization problems
SODA '04: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithmsWe study a wide range of online graph and network optimization problems, focusing on problems that arise in the study of connectivity and cuts in graphs. In a general online network design problem, we have a communication network known to the algorithm ...
Online algorithms with advice for bin packing and scheduling problems
We consider the setting of online computation with advice and study the bin packing problem and a number of scheduling problems. We show that it is possible, for any of these problems, to arbitrarily approach a competitive ratio of 1 with only a ...
Comments