CDS in General 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 2 in Connected Dominating Set: Theory and Applications, 2013, pp 11-34 from Springer

Abstract: Abstract Since Min-CDS is NP-hard, approximation algorithm design becomes an important issue in study of CDS. What is the complexity of approximation for Min-CDS? Guha and Khuller [62] showed that Min-CDS has no polynomial-time (ρ lnn)-approximation for 0

Keywords: Khuller; Performance Ratio; Approximation Algorithm Design; Broadcast Tree; Body Node (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_2

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

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

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 ().