Weighted CDS in Unit Disk Graph

Ding-Zhu Du and Peng-Jun Wan
Additional contact information
Ding-Zhu Du: University of Texas, Dallas
Peng-Jun Wan: Illinois Institute of Technology

Chapter Chapter 5 in Connected Dominating Set: Theory and Applications, 2013, pp 77-104 from Springer

Abstract: Abstract It was open for many years whether MinW-CDS in unit disk graphs has a polynomial-time constant-approximation or not. Ambühl et al. [2] discovered the first one. Their solution consists of two stages. At the first stage, they construct a dominating set which is a 72-approximation for the minimum-weight dominating set problem in unit disk graphs as follows.

Keywords: Unit Disk Graph; Polynomial-time Constant-approximation; Node-weighted Steiner Tree; Sweep Line; Approximation Performance Ratio (search for similar items in EconPapers)
Date: 2013
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:spochp:978-1-4614-5242-3_5

Ordering information: This item can be ordered from
http://www.springer.com/9781461452423

DOI: 10.1007/978-1-4614-5242-3_5

Access Statistics for this chapter

More chapters in Springer Optimization and Its Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().