#3 Enumerating partitions with ZDD
Statement
Is ZDD the best algorithm to enumerate all balanced partitions that are -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.