Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time

Bhattacharya S, Chakrabarty D, Henzinger MH. 2017. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. 19th International Conference on Integer Programming and Combinatorial Optimization. IPCO: Integer Programming and Combinatorial Optimization, LNCS, vol. 10328, 86–98.

Download (ext.)

Conference Paper | Published | English

Scopus indexed
Author
Bhattacharya, Sayan; Chakrabarty, Deeparnab; Henzinger, MonikaISTA
Series Title
LNCS
Abstract
We consider the problems of maintaining approximate maximum matching and minimum vertex cover in a dynamic graph. Starting with the seminal work of Onak and Rubinfeld [STOC 2010], this problem has received significant attention in recent years. Very recently, extending the framework of Baswana, Gupta and Sen [FOCS 2011], Solomon [FOCS 2016] gave a randomized 2-approximation dynamic algorithm for this problem that has amortized update time of O(1) with high probability. We consider the natural open question of derandomizing this result. We present a new deterministic fully dynamic algorithm that maintains a O(1)-approximate minimum vertex cover and maximum fractional matching, with an amortized update time of O(1). Previously, the best deterministic algorithm for this problem was due to Bhattacharya, Henzinger and Italiano [SODA 2015]; it had an approximation ratio of (2+ϵ) and an amortized update time of O(logn/ϵ2). Our result can be generalized to give a fully dynamic O(f3)-approximation algorithm with O(f2) amortized update time for the hypergraph vertex cover and fractional matching problems, where every hyperedge has at most f vertices.
Publishing Year
Date Published
2017-05-24
Proceedings Title
19th International Conference on Integer Programming and Combinatorial Optimization
Publisher
Springer Nature
Volume
10328
Page
86-98
Conference
IPCO: Integer Programming and Combinatorial Optimization
Conference Location
Waterloo, ON, Canada
Conference Date
2017-06-26 – 2017-06-28
IST-REx-ID

Cite this

Bhattacharya S, Chakrabarty D, Henzinger MH. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In: 19th International Conference on Integer Programming and Combinatorial Optimization. Vol 10328. Springer Nature; 2017:86-98. doi:10.1007/978-3-319-59250-3_8
Bhattacharya, S., Chakrabarty, D., & Henzinger, M. H. (2017). Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. In 19th International Conference on Integer Programming and Combinatorial Optimization (Vol. 10328, pp. 86–98). Waterloo, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-319-59250-3_8
Bhattacharya, Sayan, Deeparnab Chakrabarty, and Monika H Henzinger. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.” In 19th International Conference on Integer Programming and Combinatorial Optimization, 10328:86–98. Springer Nature, 2017. https://doi.org/10.1007/978-3-319-59250-3_8.
S. Bhattacharya, D. Chakrabarty, and M. H. Henzinger, “Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time,” in 19th International Conference on Integer Programming and Combinatorial Optimization, Waterloo, ON, Canada, 2017, vol. 10328, pp. 86–98.
Bhattacharya S, Chakrabarty D, Henzinger MH. 2017. Deterministic fully dynamic approximate vertex cover and fractional matching in O(1) amortized update time. 19th International Conference on Integer Programming and Combinatorial Optimization. IPCO: Integer Programming and Combinatorial Optimization, LNCS, vol. 10328, 86–98.
Bhattacharya, Sayan, et al. “Deterministic Fully Dynamic Approximate Vertex Cover and Fractional Matching in O(1) Amortized Update Time.” 19th International Conference on Integer Programming and Combinatorial Optimization, vol. 10328, Springer Nature, 2017, pp. 86–98, doi:10.1007/978-3-319-59250-3_8.
All files available under the following license(s):
Copyright Statement:
This Item is protected by copyright and/or related rights. [...]

Link(s) to Main File(s)
Access Level
OA Open Access

Export

Marked Publications

Open Data ISTA Research Explorer

Sources

arXiv 1611.00198

Search this title in

Google Scholar
ISBN Search