Improved or first approximation algorithms for sequential [k, ℓ]-Star Packing using local search, with ratios (k+1)/2 for k≥3 ℓ=∞, 4/3 for k=2 ℓ=∞, (1+ℓ/(ℓ+1)) for k=2<ℓ, and (1+max{(k-1)/2, (k+1)ℓ/(3(ℓ+1))}) for 3≤k<ℓ, plus APX-hardness for k=2.
Title resolution pending
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
-
Covering vertices by sequential stars
Improved or first approximation algorithms for sequential [k, ℓ]-Star Packing using local search, with ratios (k+1)/2 for k≥3 ℓ=∞, 4/3 for k=2 ℓ=∞, (1+ℓ/(ℓ+1)) for k=2<ℓ, and (1+max{(k-1)/2, (k+1)ℓ/(3(ℓ+1))}) for 3≤k<ℓ, plus APX-hardness for k=2.