pith. sign in

For any states′ inD(t ′,·), (a) Ifu ∗ ∈P ′ i andv ∗ ∈P ′ i′ withi̸=i ′ ori=i ′ = 0, we simply ignore the edge and D(t,s ′)◁ D(t ′,s ′)

Whentintroduces edge(u ∗, v∗)and has childt ′, we merge the partition, verify the distance profile, update the parent status

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

1 Pith paper citing it
browse 1 citing papers

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 18

    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.