One more well-solved case of the multifacility location problem

• Authors: Alexander V. Karzanov
• Venue: Discrete Optimization
• Year: 2004

Let @m be a metric on a finite set T. We consider a version of the multifacility location problem (also called the minimum 0-extension problem): given a finite set V@?T and a function c:V2-Z"+, attach each element x@?V-T to some @c(x)@?T minimizing @?(c(xy)@m(@c(x)@c(y)):xy@?V2), letting @c(t)=t for t@?T. It is known that the problem is solvable in polynomial time for any modular metric @m whose underlying graph is hereditary modular and orientable (in a certain sense), as well as for any median metric @m. On the other hand, it was shown that for a fixed metric @m, the problem is NP-hard if @m is nonmodular or if its underlying graph is nonorientable. Decreasing the gap between these tractable and intractable cases, we describe a wide class of modular metrics @m (including the median metrics as a special case) for which the problem is solvable in polynomial time. This result follows from our theorem on the existence of retractions of certain modular graphs, which provides an efficient uncrossing method for the class of modular metrics in question. We also present other results and raise open questions.