A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem
نویسندگان
چکیده
We give the first 2-approximation algorithm for cluster vertex deletion problem. This is tight, since approximating problem within any constant factor smaller than 2 UGC-hard. Our combines previous approaches, based on local ratio technique and management of true twins, with a novel construction “good” cost function vertices at distance most from input graph.
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولFast branching algorithm for Cluster Vertex Deletion
In the family of clustering problems we are given a set of objects (vertices of the graph), together with some observed pairwise similarities (edges). The goal is to identify clusters of similar objects by slightly modifying the graph to obtain a cluster graph (disjoint union of cliques). Hüffner et al. [LATIN 2008, Theory Comput. Syst. 2010] initiated the parameterized study of Cluster Vertex ...
متن کاملA Local 2-Approximation Algorithm for the Vertex Cover Problem
We present a distributed 2-approximation algorithm for the minimum vertex cover problem. The algorithm is deterministic, and it runs in (∆+ 1) synchronous communication rounds, where ∆ is the maximum degree of the graph. For ∆ = 3, we give a 2-approximation algorithm also for the weighted version of the problem.
متن کاملA Near-Tight Approximation Algorithm for the Robot Localization Problem
Localization is a fundamental problem in robotics. The “kidnapped robot” possesses a compass and map of its environment; it must determine its location at a minimum cost of travel distance. The problem is NP-hard [G. Dudek, K. Romanik, and S. Whitesides, SIAM J. Comput., 27 (1998), pp. 583–604] even to minimize within factor c logn [C. Tovey and S. Koenig, Proceedings of the National Conference...
متن کاملA Near Optimal Approximation Algorithm for Vertex-Cover Problem
Recently, there has been increasing interest and progress in improvising the approximation algorithm for well-known NP-Complete problems, particularly the approximation algorithm for the Vertex-Cover problem. Here we have proposed a polynomial time efficient algorithm for vertex-cover problem for more approximate to the optimal solution, which lead to the worst time complexity Θ(V ) and space c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-73879-2_24