Complexity and approximation of the connected set-cover problem
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhang, Wei | - |
dc.contributor.author | Wu, Weili | - |
dc.contributor.author | Lee, Wonjun | - |
dc.contributor.author | Du, Ding-Zhu | - |
dc.date.accessioned | 2021-09-06T18:26:10Z | - |
dc.date.available | 2021-09-06T18:26:10Z | - |
dc.date.created | 2021-06-18 | - |
dc.date.issued | 2012-07 | - |
dc.identifier.issn | 0925-5001 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/108118 | - |
dc.description.abstract | In this paper, we study the computational complexity and approximation complexity of the connected set-cover problem. We derive necessary and sufficient conditions for the connected set-cover problem to have a polynomial-time algorithm. We also present a sufficient condition for the existence of a (1 + ln delta)-approximation. In addition, one such (1 + ln delta)-approximation algorithm for this problem is proposed. Furthermore, it is proved that there is no polynomial-time -approximation for any for the connected set-cover problem on general graphs, unless NP has an quasi-polynomial Las-Vegas algorithm. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | SPRINGER | - |
dc.title | Complexity and approximation of the connected set-cover problem | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Lee, Wonjun | - |
dc.identifier.doi | 10.1007/s10898-011-9726-x | - |
dc.identifier.scopusid | 2-s2.0-84863723977 | - |
dc.identifier.wosid | 000305196500010 | - |
dc.identifier.bibliographicCitation | JOURNAL OF GLOBAL OPTIMIZATION, v.53, no.3, pp.563 - 572 | - |
dc.relation.isPartOf | JOURNAL OF GLOBAL OPTIMIZATION | - |
dc.citation.title | JOURNAL OF GLOBAL OPTIMIZATION | - |
dc.citation.volume | 53 | - |
dc.citation.number | 3 | - |
dc.citation.startPage | 563 | - |
dc.citation.endPage | 572 | - |
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.keywordAuthor | Connected set-cover | - |
dc.subject.keywordAuthor | Computational complexity | - |
dc.subject.keywordAuthor | Approximation algorithms | - |
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.