pith. sign in

A pair iscompatibleif the set of selected vertices is identical (P 1 0 =P 2 0 =P 0) and the distance profiles match (ρ1 =ρ 2)

When vertextjoins childrent 1 andt 2, we iterate over all pairs of tracess1 = (P1, ρ1, π1)for t1 ands 2 = (P2, ρ2, π2)fort 2

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 8

    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.