{"abstract":[{"lang":"eng","text":"We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph in time per update. In particular, for minimum vertex cover we provide deterministic data structures for maintaining a (2 + ε) approximation in O(log n/ε2) amortized time per update. For maximum matching, we show how to maintain a (3 + e) approximation in O(m1/3/ε2) amortized time per update, and a (4 + ε) approximation in O(m1/3/ε2) worst-case time per update. Our data structure for fully dynamic minimum vertex cover is essentially near-optimal and settles an open problem by Onak and Rubinfeld [13]."}],"oa":1,"year":"2014","author":[{"full_name":"Bhattacharya, Sayan","first_name":"Sayan","last_name":"Bhattacharya"},{"last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Italiano, Giuseppe F.","first_name":"Giuseppe F.","last_name":"Italiano"}],"day":"01","language":[{"iso":"eng"}],"page":"785-804","main_file_link":[{"url":"https://arxiv.org/abs/1412.1318","open_access":"1"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"11890"}]},"title":"Deterministic fully dynamic data structures for vertex cover and matching","citation":{"mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” 26th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 785–804, doi:10.1137/1.9781611973730.54.","ista":"Bhattacharya S, Henzinger MH, Italiano GF. 2014. Deterministic fully dynamic data structures for vertex cover and matching. 26th Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 785–804.","ieee":"S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” in 26th Annual ACM-SIAM Symposium on Discrete Algorithms, San Diego, CA, United States, 2014, pp. 785–804.","short":"S. Bhattacharya, M.H. Henzinger, G.F. Italiano, in:, 26th Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2014, pp. 785–804.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” In 26th Annual ACM-SIAM Symposium on Discrete Algorithms, 785–804. Society for Industrial and Applied Mathematics, 2014. https://doi.org/10.1137/1.9781611973730.54.","apa":"Bhattacharya, S., Henzinger, M. H., & Italiano, G. F. (2014). Deterministic fully dynamic data structures for vertex cover and matching. In 26th Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 785–804). San Diego, CA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611973730.54","ama":"Bhattacharya S, Henzinger MH, Italiano GF. Deterministic fully dynamic data structures for vertex cover and matching. In: 26th Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2014:785-804. doi:10.1137/1.9781611973730.54"},"article_processing_charge":"No","publication_identifier":{"isbn":["978-1-61197-374-7"],"eisbn":["978-1-61197-373-0"]},"date_published":"2014-01-01T00:00:00Z","quality_controlled":"1","scopus_import":"1","month":"01","date_created":"2022-08-16T12:36:42Z","publication_status":"published","publisher":"Society for Industrial and Applied Mathematics","external_id":{"arxiv":["1412.1318"]},"publication":"26th Annual ACM-SIAM Symposium on Discrete Algorithms","doi":"10.1137/1.9781611973730.54","oa_version":"Preprint","date_updated":"2023-02-21T16:32:06Z","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2015-01-04","location":"San Diego, CA, United States","end_date":"2015-01-06"},"extern":"1","_id":"11875"}