ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Is ZDD the best algorithm to enumerate all balanced partitions that are ε\varepsilon-balanced? Or is there some other method?

(a) Is there a combinatorial/geometric way to understand the pruned branches in the ZDD algorithm?

(b) Can we analyze ZDD to get better bounds on the likelihood of approximate splittability of random trees?

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.