Algorithm Search⌘K

Problemcore

Planning a company party (maximum weight independent set in a tree)

Also called Planning a company party.

Choosing guests from a company hierarchy tree so that no employee attends with their direct supervisor and the total score is maximal.

Choosing guests from a company hierarchy tree so that no employee attends with their direct supervisor and the total score is maximal.

About this page

The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.

LadderLevelWhat the next level needs
Human proofH0 no proof
  • add a proof in proofs/ (06.5)
LeanL0 no Lean part
  • name a Lean module in the lean field (07)
VisualV0 none
  • add viz/scene.ts or a figure (10)
WritingW0 stub
  • Definition
  • one source with a locator