Pith. sign in

Title resolution pending

· 2010

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

1 Pith paper citing it
browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2026 1

verdicts

CONDITIONAL 1

representative citing papers

Approximation Algorithms for Perfect Fair-Triangle Packing

cs.DS · 2026-08-07 · conditional · novelty 6.0

For the new NP-hard perfect fair-triangle packing problem, the paper provides a deterministic 1/3-approximation and a randomized (16/47 - epsilon)-approximation in polynomial time.

citing papers explorer

Showing 1 of 1 citing paper.

  • Approximation Algorithms for Perfect Fair-Triangle Packing cs.DS · 2026-08-07 · conditional · none · ref 20

    For the new NP-hard perfect fair-triangle packing problem, the paper provides a deterministic 1/3-approximation and a randomized (16/47 - epsilon)-approximation in polynomial time.