Improved Local Computation Algorithm for Set Cover via Sparsification

DOI10.1137/1.9781611975994.181MaRDI QIDQ5146979zbMATH OpenOpenAlexFDO

Authors Christoph Grunau, Slobodan Mitrović, Ronitt Rubinfeld, Ali Vakilian

Publication date 2 February 2021

Published in Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1910.14154

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Recommendations

• Speeding up cover time of sparse graphs using local knowledge
• scientific article; zbMATH DE number 1559541
• Local computation algorithms for spanners
• Note: A local-search heuristic for large set-covering problems
• Improved approximation algorithms for geometric set cover
• scientific article; zbMATH DE number 2102648
• Local algorithms for bounded degree sparsifiers in sparse graphs
• Local algorithms for sparse spanning graphs
• Local algorithms for sparse spanning graphs
• Improved approximation algorithms for geometric set cover

Cited in

(6)

• Parameterized and Exact Computation
• Beep-and-sleep: message and energy efficient set cover
• Beep-and-sleep: message and energy efficient set cover
• Local distributed rounding: generalized to MIS, matching, set cover, and beyond
• Locally computing edge orientations
• Local computation algorithms for knapsack: impossibility results, and how to avoid them

This page was built for publication: Improved Local Computation Algorithm for Set Cover via Sparsification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5146979)