Journal Article10.1016/J.JCSS.2021.01.001
A 43-approximation algorithm for the Maximum Internal Spanning Tree Problem
3
TL;DR: In this article, the authors presented an approximation algorithm with performance ratio 4 3, which improved upon the best known performance ratio 3 2, and showed that MIST is Max-SNP-hard.
read more
About: This article is published in Journal of Computer and System Sciences. The article was published on 01 Jun 2021. The article focuses on the topics: Spanning tree & Approximation algorithm.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Performance analysis of evolutionary algorithm for the maximum internal spanning tree problem
TL;DR: This paper designs a valid fitness function to guide the well-studied evolutionary algorithm, (1+1)EA, and presents theoretical analysis to show that it can obtain a performance guarantee of 2 and 5/3 in expected runtime O(nm2).
1
Scatter search for the minimum leaf spanning tree problem
TL;DR: In this paper , the authors proposed a heuristic algorithm to provide high-quality solutions (spanning trees with low number of leaves) for an input graph based on the scatter search methodology, and it combines different elements to perform an efficient search of the solution space.
Algorithms for maximum internal spanning tree problem for some graph classes
TL;DR: In this article , the authors proposed linear-time algorithms to compute a maximum internal spanning tree of cographs, block graphs, cactus graphs, chain graphs and bipartite permutation graphs.
References
•Book
Computers and Intractability: A Guide to the Theory of NP-Completeness
Michael Randolph Garey,David S. Johnson +1 more
- 01 Jan 1979
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.
The Traveling Salesman Problem with Distances One and Two
TL;DR: A polynomial-time approximation algorithm with worst-case ratio 7/6 is presented for the special case of the traveling salesman problem in which all distances are either one or two.
497
•Journal Article
Reducing to independent set structure: the case of k-internal spanning tree
Elena Prieto,Christian Sloper +1 more
TL;DR: It is shown that there exists a set of reduction rules that modify an arbitrary spanning tree of a graph into a spanning tree with no induced edges between the leaves, and how this crown decomposition can be used to obtain a O(k2) kernel for the k-INTERNAL SPANNING TREE problem.
77
Either/Or: Using Vertex Cover Structure in Designing FPT-Algorithms — the Case of k-Internal Spanning Tree
Elena Prieto,Christian Sloper +1 more
- 30 Jul 2003
TL;DR: This paper studies the parametric dual of this problem, k-Internal Spanning Tree (Does G have a spanning tree with at least k internal vertices?), and gives an algorithm running in time O.