pith. sign in

Therefore, ℓ1(w′) = (c−1)w ′ 1 −w ′ 2 ≥ℓ 1(w∗) = (c−1)w ∗ 1 −w ∗ 2 ≥0byℓ 1-dominance

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it

fields

cs.DS 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

Packing Compact Subgraphs with Applications to Districting

cs.DS · 2026-04-10 · unverdicted · novelty 7.0

Refined analysis yields O(1)-approximation for packing balanced star districts in planar graphs, extending to minor-free and bounded-expansion graphs, plus O(1) results for fixed-radius-k districts and minimum-weight variants.

citing papers explorer

Showing 1 of 1 citing paper.

  • Packing Compact Subgraphs with Applications to Districting cs.DS · 2026-04-10 · unverdicted · none · ref 14

    Refined analysis yields O(1)-approximation for packing balanced star districts in planar graphs, extending to minor-free and bounded-expansion graphs, plus O(1) results for fixed-radius-k districts and minimum-weight variants.