An exact algorithm for minimum CDS with shortest path constraint in wireless networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ding, Ling | - |
dc.contributor.author | Gao, Xiaofeng | - |
dc.contributor.author | Wu, Weili | - |
dc.contributor.author | Lee, Wonjun | - |
dc.contributor.author | Zhu, Xu | - |
dc.contributor.author | Du, Ding-Zhu | - |
dc.date.accessioned | 2021-09-07T12:46:24Z | - |
dc.date.available | 2021-09-07T12:46:24Z | - |
dc.date.created | 2021-06-14 | - |
dc.date.issued | 2011-05 | - |
dc.identifier.issn | 1862-4472 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/112535 | - |
dc.description.abstract | In this paper, we study a minimum connected dominating set problem (CDS) in wireless networks, which selects a minimum CDS with property that all intermediate nodes inside every pairwise shortest path should be included. Such a minimum CDS (we name this problem as SPCDS) is an important tache of some other algorithms for constructing a minimum CDS. We prove that finding such a minimum SPCDS can be achieved in polynomial time and design an exact algorithm with time complexity O(delta (2) n), where delta is the maximum node degree in communication graph. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER HEIDELBERG | - |
dc.subject | CONNECTED DOMINATING SETS | - |
dc.subject | UNIT DISK GRAPHS | - |
dc.subject | APPROXIMATION | - |
dc.subject | CONSTRUCTION | - |
dc.title | An exact algorithm for minimum CDS with shortest path constraint in wireless networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Wonjun | - |
dc.contributor.affiliatedAuthor | Du, Ding-Zhu | - |
dc.identifier.doi | 10.1007/s11590-010-0208-8 | - |
dc.identifier.scopusid | 2-s2.0-79952902539 | - |
dc.identifier.wosid | 000288556500008 | - |
dc.identifier.bibliographicCitation | OPTIMIZATION LETTERS, v.5, no.2, pp.297 - 306 | - |
dc.relation.isPartOf | OPTIMIZATION LETTERS | - |
dc.citation.title | OPTIMIZATION LETTERS | - |
dc.citation.volume | 5 | - |
dc.citation.number | 2 | - |
dc.citation.startPage | 297 | - |
dc.citation.endPage | 306 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Operations Research & Management Science | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Operations Research & Management Science | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | CONNECTED DOMINATING SETS | - |
dc.subject.keywordPlus | UNIT DISK GRAPHS | - |
dc.subject.keywordPlus | APPROXIMATION | - |
dc.subject.keywordPlus | CONSTRUCTION | - |
dc.subject.keywordAuthor | CDS | - |
dc.subject.keywordAuthor | Shortest path | - |
dc.subject.keywordAuthor | Exact algorithm | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.