EEMCS
Home > Publications
Home University of Twente
Education
Research
Prospective Students
Jobs
Publications
Intranet (internal)
 
 Nederlands
 Contact
 Sitemap
 Search
 Organisation

EEMCS EPrints Service


14222 Approximating minimum independent dominating sets in wireless networks
 Home Policy Brochure Browse Search User Area Contact Help

Hurink, J.L. and Nieberg, T. (2008) Approximating minimum independent dominating sets in wireless networks. Information processing letters, 109 (2). pp. 155-160. ISSN 0020-0190 *** ISI Impact 0,612 ***

This is the latest version of this eprint.

Full text available as:

PDF
 - Univ. of Twente only - Requires a PDF viewer such as GSview, Xpdf or Adobe Acrobat Reader
170 Kb

Official URL: http://dx.doi.org/10.1016/j.ipl.2008.09.021

Exported to Metis

Abstract

We present the first polynomial-time approximation scheme (PTAS) for the Minimum Independent Dominating Set problem in graphs of polynomially bounded growth which are used to model wireless communication networks.
The approach presented yields a robust algorithm, that is, it accepts any undirected graph as input, and returns a (1+ε)-approximate minimum independent dominating set, or a certificate showing that the input graph does not satisfy the bounded growth property.

Item Type:Article
Research Group:EWI-DMMP: Discrete Mathematics and Mathematical Programming, MB-OMPL: Operational Methods for Production & Logistics
Research Program:CTIT-WiSe: Wireless and Sensor Systems
Research Project:EYES: Energy-Efficient Sensor Networks
ID Code:14222
Status:Published
Deposited On:20 November 2008
Refereed:Yes
International:Yes
ISI Impact Factor:0,612
More Information:statisticsmetis

Available Versions of this Item

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item