Improved Parameterized Algorithms for Planar Dominating Set

Authors:
Iyad Kanj;Ljubomir Perkovic
Affiliations:
-;-
Venue:
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Year:
2002

Citing 10
Cited 25

Approximation algorithms for NP-complete problems on planar graphs

Journal of the ACM (JACM)
Vertex cover: further observations and further improvements

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Refined Search Tree Technique for DOMINATING SET on Planar Graphs

MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems

SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Upper Bounds for MaxSat: Further Improved

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Improved Exact Algorithms for MAX-SAT

LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Upper bounds for vertex cover further improved

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Parameterized Complexity

Parameterized Complexity

Dominating sets in planar graphs: branch-width and exponential speed-up

SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
-Approximation for Treewidth of Graphs Excluding a Graph with One Crossing as a Minor

APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs

ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Subexponential parameterized algorithms on graphs of bounded-genus and H-minor-free graphs

SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Polynomial-time data reduction for dominating set

Journal of the ACM (JACM)
Parameterized complexity: exponential speed-up for planar graph problems

Journal of Algorithms
Bidimensionality: new connections between FPT algorithms and PTASs

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality

SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fixed-parameter algorithms for (k, r)-center in planar graphs and map graphs

ACM Transactions on Algorithms (TALG)
Kernels in planar digraphs

Journal of Computer and System Sciences
Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs

Journal of the ACM (JACM)
Faster fixed parameter tractable algorithms for finding feedback vertex sets

ACM Transactions on Algorithms (TALG)
Genus characterizes the complexity of certain graph problems: Some tight results

Journal of Computer and System Sciences
Computational Study on Dominating Set Problem of Planar Graphs

COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
On parameterized exponential time complexity

Theoretical Computer Science
On Parameterized Exponential Time Complexity

TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
Computational study on planar dominating set problem

Theoretical Computer Science
Fixed-parameter algorithms for the (k, r)-center in planar graphs and map graphs

ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Fast sub-exponential algorithms and compactness in planar graphs

ESA'11 Proceedings of the 19th European conference on Algorithms
Fast algorithms for hard graph problems: bidimensionality, minors, and local treewidth

GD'04 Proceedings of the 12th international conference on Graph Drawing
A strengthened analysis of an algorithm for Dominating Set in planar graphs

Discrete Applied Mathematics
Algorithmic graph minor theory: improved grid minor bounds and wagner's contraction

ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Survey: Subexponential parameterized algorithms

Computer Science Review
Subexponential parameterized algorithms

ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs

COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

Recently, there has been a lot of interest and progress in lowering the worst-case time complexity for the PLANAR DOMINATING SET problem. In this paper, we present improved parameterized algorithms for the PLANAR DOMINATING SET problem. In particular, given a planar graph G and a positive integer k, we can compute a dominating set of size bounded by k or report that no such set exists in time O(227驴kn), where n is the number of vertices in G. Our algorithms induce a significant improvement over the previous best algorithm for the problem.