{"author":[{"last_name":"Bhattacharya","first_name":"Sayan","full_name":"Bhattacharya, Sayan"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H"},{"last_name":"Italiano","first_name":"Giuseppe F.","full_name":"Italiano, Giuseppe F."}],"month":"05","citation":{"short":"S. Bhattacharya, M.H. Henzinger, G.F. Italiano, SIAM Journal on Computing 47 (2018) 859–887.","ista":"Bhattacharya S, Henzinger MH, Italiano GF. 2018. Deterministic fully dynamic data structures for vertex cover and matching. SIAM Journal on Computing. 47(3), 859–887.","ieee":"S. Bhattacharya, M. H. Henzinger, and G. F. Italiano, “Deterministic fully dynamic data structures for vertex cover and matching,” <i>SIAM Journal on Computing</i>, vol. 47, no. 3. Society for Industrial &#38; Applied Mathematics, pp. 859–887, 2018.","apa":"Bhattacharya, S., Henzinger, M. H., &#38; Italiano, G. F. (2018). Deterministic fully dynamic data structures for vertex cover and matching. <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/140998925\">https://doi.org/10.1137/140998925</a>","mla":"Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” <i>SIAM Journal on Computing</i>, vol. 47, no. 3, Society for Industrial &#38; Applied Mathematics, 2018, pp. 859–87, doi:<a href=\"https://doi.org/10.1137/140998925\">10.1137/140998925</a>.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, and Giuseppe F. Italiano. “Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching.” <i>SIAM Journal on Computing</i>. Society for Industrial &#38; Applied Mathematics, 2018. <a href=\"https://doi.org/10.1137/140998925\">https://doi.org/10.1137/140998925</a>.","ama":"Bhattacharya S, Henzinger MH, Italiano GF. Deterministic fully dynamic data structures for vertex cover and matching. <i>SIAM Journal on Computing</i>. 2018;47(3):859-887. doi:<a href=\"https://doi.org/10.1137/140998925\">10.1137/140998925</a>"},"related_material":{"record":[{"id":"11875","status":"public","relation":"earlier_version"}]},"date_created":"2022-08-17T08:21:23Z","scopus_import":"1","title":"Deterministic fully dynamic data structures for vertex cover and matching","date_published":"2018-05-01T00:00:00Z","type":"journal_article","article_processing_charge":"No","issue":"3","volume":47,"quality_controlled":"1","publication_status":"published","status":"public","_id":"11890","external_id":{"arxiv":["1412.1318"]},"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We present the first deterministic data structures for maintaining approximate minimum vertex cover and maximum matching in a fully dynamic graph 𝐺=(𝑉,𝐸), with |𝑉|=𝑛 and |𝐸|=𝑚, in 𝑜(𝑚‾‾√) time per update. In particular, for minimum vertex cover, we provide deterministic data structures for maintaining a (2+𝜖) approximation in 𝑂(log𝑛/𝜖2) amortized time per update. For maximum matching, we show how to maintain a (3+𝜖) approximation in 𝑂(min(𝑛√/𝜖,𝑚1/3/𝜖2) amortized time per update and a (4+𝜖) approximation in 𝑂(𝑚1/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 [in 42nd ACM Symposium on Theory of Computing, Cambridge, MA, ACM, 2010, pp. 457--464].","lang":"eng"}],"publisher":"Society for Industrial & Applied Mathematics","oa_version":"Preprint","page":"859-887","publication":"SIAM Journal on Computing","doi":"10.1137/140998925","main_file_link":[{"url":"https://arxiv.org/abs/1412.1318","open_access":"1"}],"intvolume":"        47","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"article_type":"original","day":"01","date_updated":"2023-02-21T16:31:30Z","language":[{"iso":"eng"}],"year":"2018","extern":"1"}