Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, Wei | - |
dc.contributor.author | Zhang, Zhao | - |
dc.contributor.author | Wang, Wei | - |
dc.contributor.author | Zou, Feng | - |
dc.contributor.author | Lee, Wonjun | - |
dc.date.accessioned | 2021-09-06T20:21:29Z | - |
dc.date.available | 2021-09-06T20:21:29Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2012-05 | - |
dc.identifier.issn | 1382-6905 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/108537 | - |
dc.description.abstract | Latency of information propagating in wireless network is gaining more and more attention recently. This paper studies the problem of t-Latency Bounded Information Propagation (t-LBIP) problem in wireless networks which are represented by unit-disk graphs. So far, no guaranteed approximation algorithm has been achieved for t-LBIP when ta parts per thousand yen2. In this paper, we propose a Polynomial Time Approximation Scheme for t-LBIP under the condition that the maximum degree is bounded by a constant. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.subject | SET | - |
dc.title | Polynomial time approximation scheme for t-latency bounded information propagation problem in wireless networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Wonjun | - |
dc.identifier.doi | 10.1007/s10878-010-9359-x | - |
dc.identifier.scopusid | 2-s2.0-84863722854 | - |
dc.identifier.wosid | 000302381300004 | - |
dc.identifier.bibliographicCitation | JOURNAL OF COMBINATORIAL OPTIMIZATION, v.23, no.4, pp.451 - 461 | - |
dc.relation.isPartOf | JOURNAL OF COMBINATORIAL OPTIMIZATION | - |
dc.citation.title | JOURNAL OF COMBINATORIAL OPTIMIZATION | - |
dc.citation.volume | 23 | - |
dc.citation.number | 4 | - |
dc.citation.startPage | 451 | - |
dc.citation.endPage | 461 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Mathematics | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Mathematics, Applied | - |
dc.subject.keywordPlus | SET | - |
dc.subject.keywordAuthor | Wireless network | - |
dc.subject.keywordAuthor | Information propagation | - |
dc.subject.keywordAuthor | Unit disk graph | - |
dc.subject.keywordAuthor | Polynomial time approximation scheme | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
145 Anam-ro, Seongbuk-gu, Seoul, 02841, Korea+82-2-3290-2963
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.