The authors obtain an O(log m)-approximation for the coverage problem (tight, as it generalizes set cover) and the first non-trivial O(log² m)-approximation for the connectivity problem via LP relaxation and randomized rounding.
Minimize the maximum duty in multi-interface networks.Algorithmica, 63(1-2):274–295
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks
The authors obtain an O(log m)-approximation for the coverage problem (tight, as it generalizes set cover) and the first non-trivial O(log² m)-approximation for the connectivity problem via LP relaxation and randomized rounding.