Next Article in Journal / Special Issue
Tractabilities and Intractabilities on Geometric Intersection Graphs
Previous Article in Journal
Energy Efficient Routing in Wireless Sensor Networks Through Balanced Clustering
Previous Article in Special Issue
Maximum Disjoint Paths on Edge-Colored Graphs: Approximability and Tractability
Article Menu

Export Article

Open AccessArticle
Algorithms 2013, 6(1), 43-59; doi:10.3390/a6010043

Computational Study on a PTAS for Planar Dominating Set Problem

School of Computing Science, Simon Fraser University, Burnaby BC, V5A 1S6, Canada
*
Author to whom correspondence should be addressed.
Received: 2 November 2012 / Revised: 10 January 2013 / Accepted: 13 January 2013 / Published: 21 January 2013
(This article belongs to the Special Issue Graph Algorithms)
View Full-Text   |   Download PDF [150 KB, 22 January 2013; original version 21 January 2013]   |  

Abstract

The dominating set problem is a core NP-hard problem in combinatorial optimization and graph theory, and has many important applications. Baker [JACM 41,1994] introduces a k-outer planar graph decomposition-based framework for designing polynomial time approximation scheme (PTAS) for a class of NP-hard problems in planar graphs. It is mentioned that the framework can be applied to obtain an O(2ckn) time, c is a constant, (1+1/k)-approximation algorithm for the planar dominating set problem. We show that the approximation ratio achieved by the mentioned application of the framework is not bounded by any constant for the planar dominating set problem. We modify the application of the framework to give a PTAS for the planar dominating set problem. With k-outer planar graph decompositions, the modified PTAS has an approximation ratio (1 + 2/k). Using 2k-outer planar graph decompositions, the modified PTAS achieves the approximation ratio (1+1/k) in O(22ckn) time. We report a computational study on the modified PTAS. Our results show that the modified PTAS is practical. View Full-Text
Keywords: dominating set problem; PTAS; branch-decomposition based algorithms; planar graphs; computational study dominating set problem; PTAS; branch-decomposition based algorithms; planar graphs; computational study
This is an open access article distributed under the Creative Commons Attribution License (CC BY 3.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

Marzban, M.; Gu, Q.-P. Computational Study on a PTAS for Planar Dominating Set Problem. Algorithms 2013, 6, 43-59.

Show more citation formats Show less citations formats

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Algorithms EISSN 1999-4893 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top