Go to the corresponding LIPIcs Volume Portal 
pdfformat: 

@InProceedings{nutov:LIPIcs:2020:12939, author = {Zeev Nutov}, title = {{Approximating kConnected mDominating Sets}}, booktitle = {28th Annual European Symposium on Algorithms (ESA 2020)}, pages = {73:173:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {9783959771627}, ISSN = {18688969}, year = {2020}, volume = {173}, editor = {Fabrizio Grandoni and Grzegorz Herman and Peter Sanders}, publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12939}, URN = {urn:nbn:de:0030drops129392}, doi = {10.4230/LIPIcs.ESA.2020.73}, annote = {Keywords: kconnected graph, mdominating set, approximation algorithm, rooted subset kconnectivity, subset kconnectivity} }
Keywords:  kconnected graph, mdominating set, approximation algorithm, rooted subset kconnectivity, subset kconnectivity  
Collection:  28th Annual European Symposium on Algorithms (ESA 2020)  
Issue Date:  2020  
Date of publication:  26.08.2020 