Connected Dominating Set in Sensor Networks and MANETs

Jeremy Blum (), Min Ding (), Andrew Thaeler () and Xiuzhen Cheng ()
Additional contact information
Jeremy Blum: The George Washington University, Department of Computer Science
Min Ding: The George Washington University, Department of Computer Science
Andrew Thaeler: The George Washington University, Department of Computer Science
Xiuzhen Cheng: The George Washington University, Department of Computer Science

A chapter in Handbook of Combinatorial Optimization, 2004, pp 329-369 from Springer

Keywords: Sensor Network; Nodal Mobility; Steiner Tree; Steiner Point; Message Complexity (search for similar items in EconPapers)
Date: 2004
References: Add references at CitEc
Citations: View citations in EconPapers (1)

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:sprchp:978-0-387-23830-2_8

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

DOI: 10.1007/0-387-23830-1_8

Access Statistics for this chapter

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