An exact algorithm for the Maximum Leaf Spanning Tree problem
Henning Fernau,Joachim Kneis,Dieter Kratsch,Alexander Langer,Mathieu Liedloff,Daniel Raible,Peter Rossmanith +6 more
Reads0
Chats0
TLDR
This paper presents a branching algorithm whose running time has been analyzed using the Measure-and-Conquer technique and provides a lower bound of ?About:
This article is published in Theoretical Computer Science.The article was published on 2011-10-01 and is currently open access. It has received 73 citations till now. The article focuses on the topics: Spanning tree & Minimum spanning tree.read more
Citations
More filters
Journal ArticleDOI
Survey on Broadcast Algorithms for Mobile Ad Hoc Networks
Patricia Ruiz,Pascal Bouvry +1 more
TL;DR: An in-depth review of the existing state-of-the-art techniques for efficient message dissemination, as well as a new taxonomy that provides a global overview of the most relevant existing algorithms, are made.
Journal ArticleDOI
On Independent Sets and Bicliques in Graphs
TL;DR: It is shown that the maximum number of maximal bicliques in a graph on n vertices is Θ(3n/3), and an exact exponential-time algorithm is used that computes the number of distinct maximal independent sets in a graphs in time O(1.3642n), where n is thenumber of vertices of the input graph.
2-Approximation Algorithm for Finding a Spanning Tree with Maximum Number of Leaves
TL;DR: In this paper, the problem of finding a spanning tree with the maximum number of leaves was studied, and a simple 2-approximation algorithm was presented, improving on the approximation ratio of 3 achieved by the best previous algorithms.
Journal ArticleDOI
Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem
TL;DR: These algorithms for solving the minimum connected dominating set problem in an undirected graph are based on a Benders decomposition algorithm and a branch-and-cut method and a hybrid algorithm is developed that combines these two approaches.
Journal ArticleDOI
Inclusion/exclusion meets measure and conquer
TL;DR: This paper shows that inclusion/exclusion as a branching rule can be combined in a branch-and-reduce algorithm with traditional branching rules and reduction rules, and obtains the currently fastest exact exponential-time algorithms for a number of domination problems in graphs.
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.
Book
Invitation to fixed-parameter algorithms
TL;DR: This paper discusses Fixed-Parameter Algorithms, Parameterized Complexity Theory, and Selected Case Studies, and some of the techniques used in this work.
Proceedings ArticleDOI
On calculating connected dominating set for efficient routing in ad hoc wireless networks
TL;DR: In this paper, the authors proposed a simple and efficient distributed algorithm for calculating connected dominating set in ad-hoc wireless networks, where connections of nodes are determined by their geographical distances.