Capacitateci metrie labeling

Abstract

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 φ : V × L → ℜ+. 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 l i 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|)l/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|) l/2-ε). We also give a O(log |L|)-approximation algorithm for congestion.