Complexity of Single-Swap Heuristics for Metric Facility Location and Related Problems
نویسنده
چکیده
Metric facility location and K-means are well-known problems of combinatorial optimization. Both admit a fairly simple heuristic called single-swap, which adds, drops or swaps open facilities until it reaches a local optimum. For both problems, it is known that this algorithm produces a solution that is at most a constant factor worse than the respective global optimum. In this paper, we show that single-swap applied to the weighted metric uncapacitated facility location and weighted discrete K-means problem is tightly PLS-complete and hence has exponential worst-case running time.
منابع مشابه
7.2.1 Introduction 17.2.1.1 Background for K-median and Facility Location Problems 17.2.1.2 Background for Local Search Heuristics
In this note, we will survey the local search heuristics for the metric k-median and facility location problems. We define the locality gap of a local search heuristics for a minimization problem as the maximum ratio of local optimal solution (produced by local search heuristics) to the global optimal solution. For k-median, the local search with single swap has a locality gap of 5. Moreover, i...
متن کاملA Technical Report on PLS-Completeness of Single-Swap for Unweighted Metric Facility Location and K-Means
Metric facility location and K-Means are important problems in operations research and computational geometry. Both problems admit a fairly simple local search scheme called single-swap, which is known to compute a constant factor approximation of an optimal solution. Recently, [Bra17] showed that single-swap is tightly PLS-complete, which means that the local search algorithm requires exponent...
متن کاملSimpler Analyses of Local Search Algorithms for Facility Location
We study local search algorithms for metric instances of facility location problems: the uncapacitated facility location problem (UFL), as well as uncapacitated versions of the k-median, k-center and kmeans problems. All these problems admit natural local search heuristics: for example, in the UFL problem the natural moves are to open a new facility, close an existing facility, and to swap a cl...
متن کاملImproving Success Ratio in Multi-Constraint Quality of Service Routing
Multi-constraint quality-of-service routing will become increasingly important as the Internet evolves to support real-time services. It is well known however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the mo...
متن کاملInverse and Reverse 2-facility Location Problems with Equality Measures on a Network
In this paper we consider the inverse and reverse network facility location problems with considering the equity on servers. The inverse facility location with equality measure deals with modifying the weights of vertices with minimum cost, such that the difference between the maximum and minimum weights of clients allocated to the given facilities is minimized. On the other hand, the reverse c...
متن کامل