Vorlesung

#timestamp 2025-10-28

canonical form:

#timestamp 2025-12-02

When solving a dynamic problem, first think if there a re known sub-problems (base cases) that we can base our complete problem upon

two problem types:

• Packing: select as much objects (nodes, ...) from a (finite) set
  • e.g. put as many clothes as possible into a suitcase
• Covering: minimize the number of objects (nodex, ...) s.t. the condition still holds
  • e.g. cover area with as few antennas as possible