A New Deterministic Algorithm for Dynamic Set Cover
We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f se...
Uloženo v:
| Vydáno v: | Proceedings / annual Symposium on Foundations of Computer Science s. 406 - 423 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Konferenční příspěvek |
| Jazyk: | angličtina |
| Vydáno: |
IEEE
01.11.2019
|
| Témata: | |
| ISSN: | 2575-8454 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f sets, and the cost of each set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17], implies that there is a deterministic algorithm for this problem with O(f log(Cn)) amortized update time and O(min(log n, f)) -approximation ratio, which nearly matches the polynomial-time hardness of approximation for minimum set cover in the static setting. Our update time is only O(log (Cn)) away from a trivial lower bound. Prior to our work, the previous best approximation ratio guaranteed by deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15]. In contrast, the only result that guaranteed O(f) -approximation was obtained very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with (1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the extra O(f) factor in the update time compared to our and Gupta~et~al.'s results, the Abboud~et~al.~algorithm is randomized, and works only when the adversary is oblivious and the sets are unweighted (each set has the same cost). We achieve our result via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual algorithms that try to satisfy some local constraints for individual sets at all time, our algorithm basically waits until the dual solution changes significantly globally, and fixes the solution only where the fix is needed. |
|---|---|
| AbstractList | We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the input set system is undergoing element insertions and deletions. Here, n denotes the number of elements, each element appears in at most f sets, and the cost of each set lies in the range [1/C, 1]. Our result, together with that of Gupta~et~al.~[STOC'17], implies that there is a deterministic algorithm for this problem with O(f log(Cn)) amortized update time and O(min(log n, f)) -approximation ratio, which nearly matches the polynomial-time hardness of approximation for minimum set cover in the static setting. Our update time is only O(log (Cn)) away from a trivial lower bound. Prior to our work, the previous best approximation ratio guaranteed by deterministic algorithms was O(f^2), which was due to Bhattacharya~et~al.~[ICALP`15]. In contrast, the only result that guaranteed O(f) -approximation was obtained very recently by Abboud~et~al.~[STOC`19], who designed a dynamic algorithm with (1+ε)f-approximation ratio and O(f^2 log n/ε) amortized update time. Besides the extra O(f) factor in the update time compared to our and Gupta~et~al.'s results, the Abboud~et~al.~algorithm is randomized, and works only when the adversary is oblivious and the sets are unweighted (each set has the same cost). We achieve our result via the primal-dual approach, by maintaining a fractional packing solution as a dual certificate. This approach was pursued previously by Bhattacharya~et~al.~and Gupta~et~al., but not in the recent paper by Abboud~et~al. Unlike previous primal-dual algorithms that try to satisfy some local constraints for individual sets at all time, our algorithm basically waits until the dual solution changes significantly globally, and fixes the solution only where the fix is needed. |
| Author | Bhattacharya, Sayan Nanongkai, Danupon Henzinger, Monika |
| Author_xml | – sequence: 1 givenname: Sayan surname: Bhattacharya fullname: Bhattacharya, Sayan organization: University of Warwick – sequence: 2 givenname: Monika surname: Henzinger fullname: Henzinger, Monika organization: University of Vienna – sequence: 3 givenname: Danupon surname: Nanongkai fullname: Nanongkai, Danupon organization: KTH Royal Institute of Technology |
| BookMark | eNotjj1PwzAUAA0CiaYwM7D4DyT468XPY5RSQKroUJirxHkGoyZBTgTqv6cSTCfdcLqMXQzjQIzdSlFIKdz9elvvCiWkK4QQWp-xTFqF0jhQcM4WCizkaMBcsWyaPoUwAoRZMF3xF_rhK5op9XGI0xw9rw7vY4rzR8_DmPjqODT9ye5o5vX4TemaXYbmMNHNP5fsbf3wWj_lm-3jc11t8qiMnHPvO9ABfSvB-4DWl61TDaANIrSkEI0LGNouWGhVsKpDV_qycVZpCadvvWR3f91IRPuvFPsmHffoDJZQ6l_9LUUf |
| ContentType | Conference Proceeding |
| DBID | 6IE 6IH CBEJK RIE RIO |
| DOI | 10.1109/FOCS.2019.00033 |
| DatabaseName | IEEE Electronic Library (IEL) Conference Proceedings IEEE Proceedings Order Plan (POP) 1998-present by volume IEEE Xplore All Conference Proceedings IEEE Electronic Library (IEL) IEEE Proceedings Order Plans (POP) 1998-present |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Mathematics Computer Science |
| EISBN | 1728149525 9781728149523 |
| EISSN | 2575-8454 |
| EndPage | 423 |
| ExternalDocumentID | 8948656 |
| Genre | orig-research |
| GroupedDBID | --Z 29O 6IE 6IH 6IK ALMA_UNASSIGNED_HOLDINGS CBEJK RIE RIO |
| ID | FETCH-LOGICAL-i241t-ccd53f8cb15ccf87c6b92a587f0fbe28849f8fbdf75b2f72d896c6a9723154953 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 17 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000510015300024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| IngestDate | Wed Aug 27 02:31:38 EDT 2025 |
| IsPeerReviewed | false |
| IsScholarly | true |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-i241t-ccd53f8cb15ccf87c6b92a587f0fbe28849f8fbdf75b2f72d896c6a9723154953 |
| PageCount | 18 |
| ParticipantIDs | ieee_primary_8948656 |
| PublicationCentury | 2000 |
| PublicationDate | 2019-Nov. |
| PublicationDateYYYYMMDD | 2019-11-01 |
| PublicationDate_xml | – month: 11 year: 2019 text: 2019-Nov. |
| PublicationDecade | 2010 |
| PublicationTitle | Proceedings / annual Symposium on Foundations of Computer Science |
| PublicationTitleAbbrev | SFCS |
| PublicationYear | 2019 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| SSID | ssj0040504 |
| Score | 2.2867951 |
| Snippet | We present a deterministic dynamic algorithm for maintaining a (1+ε)f-approximate minimum cost set cover with O(f log(Cn)/ε^2) amortized update time, when the... |
| SourceID | ieee |
| SourceType | Publisher |
| StartPage | 406 |
| SubjectTerms | Approximation algorithms Computer science Data structures dynamic algorithms Dynamics Heuristic algorithms matching Optimization set cover |
| Title | A New Deterministic Algorithm for Dynamic Set Cover |
| URI | https://ieeexplore.ieee.org/document/8948656 |
| WOSCitedRecordID | wos000510015300024&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LTwIxEJ4g8aAXFDC-04NHV5btbts5EpB4EUnQhBvZvpREwcDi77ftLujBi7e2SdNkmnmkne_7AG6k4hZzdP6NMolSVwNEUnM35ZShYOHvKYhN8NFITKc4rsHtDgtjjAnNZ-bOD8Nfvl6qjX8q6whMhas_9mCPc1ZitbZR19UdcVpR93Rj7Ayf-hPfuOXZKGOvivtLOyWkjmHjf4ceQfsHg0fGu-xyDDWzaEJjK8JAKp9swuHjjnh13QLaIy5skUHV5BJYmEnv_XW5mhdvH8RVqGRQatCTiSlI3zdwtuFleP_cf4gqXYRo7vJtESmlM2qFkt1MKSu4YhKTPBPcxlaaRIgUrbBSW57JxPJEC2SK5V5fzBOyZfQE6ovlwpwCYcZvR2tjjxPhEk0qJMVcS226nNIzaHmLzD5L6otZZYzzv5cv4MCbvITqXUK9WG3MFeyrr2K-Xl2H-_oGpIeWEw |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3LTgIxFL1BNFE3KGB824VLR2amM9N2SUCCEZAETNiR6UtJFAwMfr9tZ0AXbty1TZomt7mPtPecA3DLBdEsZca_GQ-9yNQAHpfETAlOGE3c35MTmyCDAZ1M2LAEd1ssjFLKNZ-pezt0f_lyIdb2qaxBWURN_bEDu3EUhX6O1trEXVN5-FFB3hP4rNF5bo1s65blo_StLu4v9RSXPDqV_x17BPUfFB4abvPLMZTUvAqVjQwDKryyCof9LfXqqga4iUzgQu2izcXxMKPm--tiOcvePpCpUVE7V6FHI5Whlm3hrMNL52Hc6nqFMoI3Mxk384SQMdZU8CAWQlMiEs7CNKZE-5qrkNKIaaq51CTmoSahpCwRSWoVxiwlW4xPoDxfzNUpoETZ7Uxr3yJFCGcqohyzVHKpAoLxGdSsRaafOfnFtDDG-d_LN7DfHfd7097j4OkCDqz5c-DeJZSz5VpdwZ74ymar5bW7u2-jTZla |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Proceedings+%2F+annual+Symposium+on+Foundations+of+Computer+Science&rft.atitle=A+New+Deterministic+Algorithm+for+Dynamic+Set+Cover&rft.au=Bhattacharya%2C+Sayan&rft.au=Henzinger%2C+Monika&rft.au=Nanongkai%2C+Danupon&rft.date=2019-11-01&rft.pub=IEEE&rft.eissn=2575-8454&rft.spage=406&rft.epage=423&rft_id=info:doi/10.1109%2FFOCS.2019.00033&rft.externalDocID=8948656 |