A parameterized runtime analysis of randomized local search and evolutionary algorithm for max l-uncut
Pallavi Jain,Lawqueen Kanesh,Jayakrishnan Madathil,Saket Saurabh +3 more
- pp 326-327
Reads0
Chats0
TLDR
This paper analyzes the parameterized running time of a randomized local search algorithm (RLS) for Max Balanced l-Uncut where the parameter is the number of uncut edges and designs a fixed parameter tractable randomizedLocal search and a (1 + 1) EA for Max l- uncut and proves that they perform equally well.Abstract:
In the last few years, parameterized complexity has emerged as a new tool to analyze the running time of randomized local search algorithm. However, such analysis are few and far between. In this paper, we do a parameterized running time analysis of a randomized local search algorithm and a (1 + 1) EA for a classical graph partitioning problem, namely, Max l-Uncut, and its balanced counterpart Max Balanced l-Uncut. In Max l-Uncut, given an undirected graph G = (V, E), the objective is to find a partition of V(G) into l parts such that the number of uncut edges - edges within the parts - is maximized. In the last few years, Max l-Uncut and Max Balanced l-Uncut are studied extensively from the approximation point of view. In this paper, we analyze the parameterized running time of a randomized local search algorithm (RLS) for Max Balanced l-Uncut where the parameter is the number of uncut edges. RLS generates a solution of specific fitness in polynomial time for this problem. Furthermore, we design a fixed parameter tractable randomized local search and a (1 + 1) EA for Max l-Uncut and prove that they perform equally well.read more
References
More filters
Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
TL;DR: The second edition of a quarterly column as discussed by the authors provides a continuing update to the list of problems (NP-complete and harder) presented by M. R. Garey and myself in our book "Computers and Intractability: A Guide to the Theory of NP-Completeness,” W. H. Freeman & Co., San Francisco, 1979.
Proceedings ArticleDOI
Polynomial algorithm for the k-cut problem
TL;DR: A polynomial algorithm for the case of a fixed k, to find a partition of an edge weighted graph into k nonempty components, such that the total edge weight between components is minimum.
Journal ArticleDOI
Local search and the local structure of NP-complete problems
TL;DR: It is shown that certain NP-complete problems (traveling salesman, min-cut graph partitioning, graph coloring, partition and a version of the satisfiability problem) satisfy a difference equation wit respect to a certain neighborhood that is similar to the wave equation of mathematical physics.
Journal ArticleDOI
Fixed-Parameter Evolutionary Algorithms and the Vertex Cover Problem
Stefan Kratsch,Frank Neumann +1 more
TL;DR: It is shown that evolutionary algorithms solve the vertex cover problem efficiently if the size of a minimum vertex cover is not too large, i.e., the expected runtime is bounded by O(f(OPT)⋅nc), where c is a constant and f a function that only depends on OPT.
Related Papers (5)
An improved parameterized algorithm for the minimum node multiway cut problem
Jianer Chen,Yang Liu,Songjian Lu +2 more
A Randomized Time-Work Optimal Parallel Algorithm for Finding a Minimum Spanning Forest
Seth Pettie,Vijaya Ramachandran +1 more