Local Distributed Rounding: Generalized to MIS, Matching, Set Cover, and Beyond.
Salwa FaourMohsen GhaffariChristoph GrunauFabian KuhnVáclav RozhonPublished in: SODA (2023)
Keyphrases
- set cover
- approximation algorithms
- greedy algorithm
- np hard
- greedy heuristics
- network flow
- distributed systems
- linear programming
- matching algorithm
- special case
- worst case
- solution space
- minimum cost
- convex hull
- information systems
- multi dimensional
- machine learning
- scheduling problem
- management information systems
- data streams