### Abstract

Original language | Undefined |
---|---|

Title of host publication | 3rd International Workshop on Approximation and Online Algorithms, WAOA 2005 |

Editors | Thomas Erlebach, Giuseppe Persiano |

Place of Publication | Heidelberg, Germany |

Publisher | Springer Verlag |

Pages | 296-306 |

Number of pages | 11 |

ISBN (Print) | 3-540-32207-8 |

DOIs | |

State | Published - 2006 |

Event | 3rd International Workshop on Approximation and Online Algorithms 2005 - Palma de Mallorca, Spain |

### Publication series

Name | Lecture Notes in Computer Science |
---|---|

Publisher | Springer-Verlag |

Volume | 3879 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Workshop

Workshop | 3rd International Workshop on Approximation and Online Algorithms 2005 |
---|---|

Abbreviated title | WAOA 2005 |

Country | Spain |

City | Palma de Mallorca |

Period | 6/10/05 → 7/10/05 |

### Fingerprint

### Keywords

- EC Grant Agreement nr.: FP5/34734
- IR-62840
- METIS-239250
- EWI-1685

### Cite this

*3rd International Workshop on Approximation and Online Algorithms, WAOA 2005*(pp. 296-306). [10.1007/11671411_23] (Lecture Notes in Computer Science; Vol. 3879). Heidelberg, Germany: Springer Verlag. DOI: 10.1007/11671411_23

}

*3rd International Workshop on Approximation and Online Algorithms, WAOA 2005.*, 10.1007/11671411_23, Lecture Notes in Computer Science, vol. 3879, Springer Verlag, Heidelberg, Germany, pp. 296-306, 3rd International Workshop on Approximation and Online Algorithms 2005, Palma de Mallorca, Spain, 6-7 October. DOI: 10.1007/11671411_23

**A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs.** / Nieberg, T.; Hurink, Johann L.

Research output: Scientific - peer-review › Conference contribution

TY - CHAP

T1 - A PTAS for the Minimum Dominating Set Problem in Unit Disk Graphs

AU - Nieberg,T.

AU - Hurink,Johann L.

PY - 2006

Y1 - 2006

N2 - We present a polynomial-time approximation scheme (PTAS) for the minimum dominating set problem in unit disk graphs. In contrast to previously known approximation schemes for the minimum dominating set problem on unit disk graphs, our approach does not assume a geometric representation of the vertices (specifying the positions of the disks in the plane) to be given as part of the input. The runtime of the PTAS is n O(1/εlog 1/ε). The algorithm accepts any undirected graph as input, and returns a (1 + ε)-approximate minimum dominating set, or a certificate showing that the input graph is no unit disk graph, making the algorithm robust. The PTAS can easily be adapted to other classes of geometric intersection graphs.

AB - We present a polynomial-time approximation scheme (PTAS) for the minimum dominating set problem in unit disk graphs. In contrast to previously known approximation schemes for the minimum dominating set problem on unit disk graphs, our approach does not assume a geometric representation of the vertices (specifying the positions of the disks in the plane) to be given as part of the input. The runtime of the PTAS is n O(1/εlog 1/ε). The algorithm accepts any undirected graph as input, and returns a (1 + ε)-approximate minimum dominating set, or a certificate showing that the input graph is no unit disk graph, making the algorithm robust. The PTAS can easily be adapted to other classes of geometric intersection graphs.

KW - EC Grant Agreement nr.: FP5/34734

KW - IR-62840

KW - METIS-239250

KW - EWI-1685

U2 - 10.1007/11671411_23

DO - 10.1007/11671411_23

M3 - Conference contribution

SN - 3-540-32207-8

T3 - Lecture Notes in Computer Science

SP - 296

EP - 306

BT - 3rd International Workshop on Approximation and Online Algorithms, WAOA 2005

PB - Springer Verlag

ER -