Algorithms for minimum m-connected k-tuple dominating set problem
- Author
- WEIPING SHANG1 2 ; PENGJUN WAN3 ; FRANCES YAO2 ; XIAODONG HU1
[1] Institute of Applied Mathematics, Chinese Academy of Sciences, Beijing 10080, China
[2] Department of Computer Science, City University of Hong Kong, Hong-Kong
[3] Department of Computer Science, Illinois Institute of Technology, Chicago, IL 60616, United States - Source
Theoretical computer science. 2007, Vol 381, Num 1-3, pp 241-247, 7 p ; ref : 12 ref
- CODEN
- TCSCDI
- ISSN
- 0304-3975
- Scientific domain
- Computer science
- Publisher
- Elsevier, Amsterdam
- Publication country
- Netherlands
- Document type
- Article
- Language
- English
- Author keyword
- Approximation algorithm Connected dominating set Wireless sensor networks k-vertex connectivity
- Keyword (fr)
- Algorithme approximation Approximation Calcul tolérant les pannes Connectivité graphe Diffusion(télécommunications) Efficacité Ensemble dominant Informatique théorique Monitorage Radiodiffusion Routage Réseau Superficie Tolérance faute Vertex 58A25 68M15 68W25 68Wxx
- Keyword (en)
- Approximation algorithm Approximation Fault tolerant computing Graph connectivity Broadcasting Efficiency Dominating set Computer theory Monitoring Broadcasting Routing Network Area Fault tolerance Vertex
- Keyword (es)
- Algoritmo aproximación Aproximación Conectividad grafo Eficacia Conjunto dominando Informática teórica Monitoreo Radiodifusión Enrutamiento Red Superficie Tolerancia falta Vértice
- Classification
- Pascal
- 001 Exact sciences and technology / 001A Sciences and techniques of general use / 001A02 Mathematics / 001A02G Topology. Manifolds and cell complexes. Global analysis and analysis on manifolds / 001A02G04 Global analysis, analysis on manifolds
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A05 Algorithmics. Computability. Computer arithmetics
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02A Theoretical computing / 001D02A08 Miscellaneous
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D02 Computer science; control theory; systems / 001D02B Software / 001D02B10 Computer systems performance. Reliability
- Discipline
- Computer science : theoretical automation and systems Mathematics
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 18977599
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1016/j.tcs.2007.04.035 
https://dx.doi.org/10.1016/j.tcs.2007.04.035
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.tcs.2007.04.035\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:65:\"Algorithms for minimum m-connected k-tuple dominating set problem\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:3:\"381\";s:8:\"\u0000*\u0000issue\";s:3:\"1-3\";s:8:\"\u0000*\u0000spage\";s:3:\"241\";s:8:\"\u0000*\u0000epage\";s:3:\"247\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:13:\"WEIPING SHANG\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:11:\"PENGJUN WAN\";i:1;s:11:\"FRANCES YAO\";i:2;s:11:\"XIAODONG HU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:65:\"Algorithms for minimum m-connected k-tuple dominating set problem\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"7\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.tcs.2007.04.035\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:65:\"Algorithms for minimum m-connected k-tuple dominating set problem\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:3:\"381\";s:8:\"\u0000*\u0000issue\";s:3:\"1-3\";s:8:\"\u0000*\u0000spage\";s:3:\"241\";s:8:\"\u0000*\u0000epage\";s:3:\"247\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:13:\"WEIPING SHANG\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:11:\"PENGJUN WAN\";i:1;s:11:\"FRANCES YAO\";i:2;s:11:\"XIAODONG HU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:65:\"Algorithms for minimum m-connected k-tuple dominating set problem\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"7\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.tcs.2007.04.035\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.tcs.2007.04.035\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:65:\"Algorithms for minimum m-connected k-tuple dominating set problem\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:3:\"381\";s:8:\"\u0000*\u0000issue\";s:3:\"1-3\";s:8:\"\u0000*\u0000spage\";s:3:\"241\";s:8:\"\u0000*\u0000epage\";s:3:\"247\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:13:\"WEIPING SHANG\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:11:\"PENGJUN WAN\";i:1;s:11:\"FRANCES YAO\";i:2;s:11:\"XIAODONG HU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:65:\"Algorithms for minimum m-connected k-tuple dominating set problem\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"7\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.tcs.2007.04.035\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:65:\"Algorithms for minimum m-connected k-tuple dominating set problem\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:3:\"381\";s:8:\"\u0000*\u0000issue\";s:3:\"1-3\";s:8:\"\u0000*\u0000spage\";s:3:\"241\";s:8:\"\u0000*\u0000epage\";s:3:\"247\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:13:\"WEIPING SHANG\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:11:\"PENGJUN WAN\";i:1;s:11:\"FRANCES YAO\";i:2;s:11:\"XIAODONG HU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:65:\"Algorithms for minimum m-connected k-tuple dominating set problem\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"7\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:25:\"10.1016\/j.tcs.2007.04.035\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:65:\"Algorithms for minimum m-connected k-tuple dominating set problem\";s:9:\"\u0000*\u0000jtitle\";s:28:\"Theoretical computer science\";s:9:\"\u0000*\u0000stitle\";s:18:\"Theor. comput. sci\";s:7:\"\u0000*\u0000date\";s:4:\"2007\";s:9:\"\u0000*\u0000volume\";s:3:\"381\";s:8:\"\u0000*\u0000issue\";s:3:\"1-3\";s:8:\"\u0000*\u0000spage\";s:3:\"241\";s:8:\"\u0000*\u0000epage\";s:3:\"247\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0304-3975\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:13:\"WEIPING SHANG\";s:10:\"\u0000*\u0000aufirst\";s:0:\"\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:3:{i:0;s:11:\"PENGJUN WAN\";i:1;s:11:\"FRANCES YAO\";i:2;s:11:\"XIAODONG HU\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"TCSCDI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:65:\"Algorithms for minimum m-connected k-tuple dominating set problem\";s:8:\"\u0000*\u0000place\";s:9:\"Amsterdam\";s:6:\"\u0000*\u0000pub\";s:8:\"Elsevier\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:1:\"7\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
