A local search algorithm for binary maximum 2-path partitioning
نویسندگان
چکیده
منابع مشابه
A local search algorithm for binary maximum 2-path partitioning
Abstract. Let G be a complete (undirected) graph with 3l vertices. Given a binary weight function on the edges of G, the binary maximum 2-path partitioning problem is to compute a set of of l vertex-disjoint simple 2-edge paths with maximum total edge weight. The problem is NP-hard [6]. In this paper we propose a simple local search algorithm with polynomial running time for the problem and ana...
متن کاملA parallel local-search algorithm for the k-partitioning problem
In this paper we present a new algorithm for the kpartitioning problem which achieves an improved solution quality compared to known heuristics. We apply the principle of so called “helpful sets”, which has shown to be very efficient for graph bisection, to the direct k-partitioning problem. The principle is extended in several ways. We introduce a new abstraction technique which shrinks the gr...
متن کاملA New Local Search Algorithm for Binary Optimization
W develop a new local search algorithm for binary optimization problems, whose complexity and performance are explicitly controlled by a parameter Q, measuring the depth of the local search neighborhood. We show that the algorithm is pseudo-polynomial for general cost vector c, and achieves a w2/42w−15 approximation guarantee for set packing problems with exactly w ones in each column of the co...
متن کاملA General Purpose Local Search Algorithm for Binary Optimization
We develop a general purpose local search algorithm for binary optimization problems, whose complexity and performance are explicitly controlled by a parameter Q, measuring the depth of the local search neighborhood. We show that the algorithm is pseudo-polynomial for general cost vector c, and achieves a w 2 2w−1 approximation guarantee for set packing problems with exactly w ones in each colu...
متن کاملA Deterministic Approximation Algorithm for Maximum 2-Path Packing
This paper deals with the maximum-weight 2-path packing problem (M2PP), which is the problem of computing a set of vertex-disjoint paths of length 2 in a given edge-weighted complete graph so that the total weight of edges in the paths is maximized. Previously, Hassin and Rubinstein gave a randomized cubic-time approximation algorithm for M2PP which achieves an expected ratio of 35 67 − ≈ 0.522...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2013
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2013.09.001