%0 Conference Paper %1 conf/esa/AssadiS21 %A Assadi, Sepehr %A Solomon, Shay %B ESA %D 2021 %E Mutzel, Petra %E Pagh, Rasmus %E Herman, Grzegorz %I Schloss Dagstuhl - Leibniz-Zentrum für Informatik %K dblp %P 8:1-8:18 %T Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach. %U http://dblp.uni-trier.de/db/conf/esa/esa2021.html#AssadiS21 %V 204 %@ 978-3-95977-204-4

@inproceedings{conf/esa/AssadiS21, added-at = {2021-08-31T00:00:00.000+0200}, author = {Assadi, Sepehr and Solomon, Shay}, biburl = {https://www.bibsonomy.org/bibtex/2cadd10a5b224b11c516f1df1771c014b/dblp}, booktitle = {ESA}, crossref = {conf/esa/2021}, editor = {Mutzel, Petra and Pagh, Rasmus and Herman, Grzegorz}, ee = {https://doi.org/10.4230/LIPIcs.ESA.2021.8}, interhash = {1bd03073c931d8681ac9b994b2e55c9e}, intrahash = {cadd10a5b224b11c516f1df1771c014b}, isbn = {978-3-95977-204-4}, keywords = {dblp}, pages = {8:1-8:18}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik}, series = {LIPIcs}, timestamp = {2024-04-09T13:34:12.000+0200}, title = {Fully Dynamic Set Cover via Hypergraph Maximal Matching: An Optimal Approximation Through a Local Approach.}, url = {http://dblp.uni-trier.de/db/conf/esa/esa2021.html#AssadiS21}, volume = 204, year = 2021 }