ABSTRACT
We define the balanced metric labeling problem, a generalization of the metric labeling problem, in which each label has a capacity, i.e., at most l vertices can be assigned to it. The balanced metric labeling problem is a generalization of fundamental problems in the area of approximation algorithms, e.g., arrangements and balanced partitions of graphs. It is also motivated by resource limitations in certain practical scenarios. We focus on the case where the given metric is uniform and note that this case alone encompasses various well-known graph partitioning problems. We present the first (pseudo) approximation algorithm for this problem, achieving for any ε, 0 < ε < 1, an approximation factor of O((ln n)/ε), while assigning at most min {O(ln k)/1 - ε, l + 1| ( 1 + ε) l vertices to each label (k is the number of labels). Our approximation algorithm is based on a novel randomized rounding of a linear programming formulation that combines an embedding of the graph in a simplex together with spreading metrics and additional constraints that strengthen the formulation. Our randomized rounding technique uses both a randomized metric decomposition technique and a randomized label assignment technique. At the heart of our approach is the fact that only limited dependency is created between the labels assigned to different vertices, allowing us to bound the expected cost of the solution and the number of vertices assigned to each label, simultaneously. We note that the number of vertices assigned to each label is bounded via a new inequality of Janson[15] for tail bounds of (partly) dependent random variables.
- N. Alon and J. Spencer. The probabilistic method. Wiley, New York, 2000.Google ScholarCross Ref
- A. Archer, J. Fakcharoenphol, C. Harrelson, R. Krauthgamer, and E. Tardos. Approximate classification via earthmover metrics. In Proc. of the 15th ACM-SIAM Annual Symposium on Discrete Algorithms, pp. 1072--1080, 2004. Google ScholarDigital Library
- S. Arora, S. Rao, and U. Vazirani. Expander flows and a √log n-approximation to sparsest cut. In Proc. of the 36th ACM Symposium on Theory of Computing, pp. 222--231, 2004. Google ScholarDigital Library
- Y. Bartal. On approximating arbitrary metrics by tree metrics. In Proc. of the 30th Annual ACM Symposium on Theory of Computing, pp. 184--193, 1996. Google ScholarDigital Library
- Y. Bartal. Probabilistic approximation of metric spaces and its algorithmic applications. In Proc. of the 37th IEEE Symposium on Foundations of Computer Science, pp. 184--193, 1996. Google ScholarDigital Library
- C. Chekuri, S. Khanna, J. Naor, and L. Zosin. Approximation algorithms for the metric labeling problem via a new linear programming formulation. In Proc. of the 12th Annual ACM/SIAM Symposium on Discrete Algorithms, pp. 109--118, 2001. Google ScholarDigital Library
- J. Chuzhoy and J. Naor. The hardness of metric labeling. In Proc. of the 45th IEEE Symposium on Foundations of Computer Science, pp. 108--114, 2004. Google ScholarDigital Library
- G. Cualinescu, H. Karloff, and Y. Rabani. Approximation algorithms for the 0-extension problem. In Proc. of the 12th ACM-SIAM Annual Symposium on Discrete Algorithms, pp. 8--16, 2001. Google ScholarDigital Library
- G. Even, J. Naor, S. Rao, and B. Schieber. Fast approximate graph partitioning algorithms. SIAM Journal on Computing, 28:2187--2214, 1999. Google ScholarDigital Library
- G. Even, J. Naor, S. Rao, and B. Schieber. Divide-and-conquer approximation algorithms via spreading metrics. Journal of the ACM, 47:585--616, 2000. Google ScholarDigital Library
- J. Fakcharoenphol, C. Harrelson, S. Rao, and K. Talwar. An improved approximation algorithm for the 0-extension problem. In Proc. of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 257--265, 2003. Google ScholarDigital Library
- J. Fakcharoenphol, S. Rao, and K. Talwar. A tight bound on approximating arbitrary metrics by tree metrics. In Proc. of the 35th Annual ACM Symposium on Theory of Computing, pp. 448--455, 2003. Google ScholarDigital Library
- U. Feige and R. Krauthgamer. A polylogarithmic approximation of the minimum bisection. SIAM Journal on Computing, 31:1090--1118, 2002. Google ScholarDigital Library
- A. Gupta and E. Tardos. Constant factor approximation algorithms for a class of classification problems. In Proc. of the 32nd Annual ACM Symposium on the Theory of Computing, pp. 652--658, 2000. Google ScholarDigital Library
- S. Janson. Large deviations for sums of partly dependent random variables. Random Structures and Algorithms, 24(3):234--248, 2004. Google ScholarDigital Library
- J. Kleinberg and E. Tardos. Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields. Journal of the ACM, 49:616--630, 2002. Google ScholarDigital Library
- T. Leighton and S. Rao. Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms. Journal of the ACM, 46:787--832, 1999. Google ScholarDigital Library
Index Terms
- Balanced metric labeling
Recommendations
From balanced graph partitioning to balanced metric labeling
ESA'05: Proceedings of the 13th annual European conference on AlgorithmsThe Metric Labeling problem is an elegant and powerful mathematical model capturing a wide range of classification problems that arise in computer vision and related fields. In a typical classification problem, one wishes to assign labels to a set of ...
Capacitated Metric Labeling
SODA '11: Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete algorithmsWe introduce Capacitated Metric Labeling. As in Metric Labeling, we are given a weighted graph G = (V, E), a label set L, a semimetric dl on this label set, and an assignment cost function φ: V x L → R+. The goal in Metric Labeling is to find an ...
On Earthmover Distance, Metric Labeling, and 0-Extension
We study the fundamental classification problems 0-Extension and Metric Labeling. A generalization of Multiway Cut, 0-Extension is closely related to partitioning problems in graph theory and to Lipschitz extensions in Banach spaces; its generalization ...
Comments