Approximation algorithms for scheduling unrelated parallel machines
Mathematical Programming: Series A and B
An approximation algorithm for the generalized assignment problem
Mathematical Programming: Series A and B
Chernoff-Hoeffding Bounds for Applications with Limited Independence
SIAM Journal on Discrete Mathematics
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Journal of the ACM (JACM)
A constant factor approximation algorithm for a class of classification problems
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Divide-and-conquer approximation algorithms via spreading metrics
Journal of the ACM (JACM)
Approximation algorithms for the metric labeling problem via a new linear programming formulation
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A Polylogarithmic Approximation of the Minimum Bisection
SIAM Journal on Computing
An improved approximation algorithm for the 0-extension problem
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Minimizing Congestion in General Networks
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
A tight bound on approximating arbitrary metrics by tree metrics
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Single-source unsplittable flow
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Probabilistic approximation of metric spaces and its algorithmic applications
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Approximation algorithms for disjoint paths problems
Approximation algorithms for disjoint paths problems
Approximate classification via earthmover metrics
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
The Hardness of Metric Labeling
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Approximation Algorithms for the 0-Extension Problem
SIAM Journal on Computing
Hardness of the undirected edge-disjoint paths problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Theory of Computing Systems
Hardness of routing with congestion in directed graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Optimal hierarchical decompositions for congestion minimization in networks
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Hi-index | 0.00 |
We 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 &phis;: V x L → R+. The goal in Metric Labeling is to find an assignment f: V → L that minimizes a particular two-cost function. Here we add the additional restriction that each label ti receive at most li nodes, and we refer to this problem as Capacitated Metric Labeling. Allowing the problem to specify capacities on each label allows the problem to more faithfully represent the classification problems that Metric Labeling is intended to model. Our main positive result is a polynomial-time, O(log |V|)-approximation algorithm when the number of labels is fixed, which is the most natural parameter range for classification problems. We also prove that it is impossible to approximate the value of an instance of Capacitated Metric Labeling to within any finite factor, if P ≠ NP. Yet this does not address the more interesting question of how hard Capacitated Metric Labeling is to approximate when we are allowed to violate capacities. To study this question, we introduce the notion of the "congestion" of an instance of Capacitated Metric Labeling. We prove that (under certain complexity assumptions) there is no polynomial-time approximation algorithm that can approximate the congestion to within O((log|L|)1/2−∈) (for any ∈ 0) and this implies as a corollary that any polynomial-time approximation algorithm that achieves a finite approximation ratio must multiplicatively violate the label capacities by Ω((log |L|)1/2−∈). We also give a O(log |L|)-approximation algorithm for congestion.