Cost minimization covered by section → Dijkstra

Given many intervals and costs, consider combining them to cover a particular interval at the lowest cost This is attributed to the shortest path problem and can be solved by the [Dijkstra method

• Minimize the cost of covering in sections
• cover with a section

---

This page is auto-translated from /nishio/区間で覆うコスト最小化→ダイクストラ using DeepL. If you looks something interesting but the auto-translated English is not good enough to understand it, feel free to let me know at @nishio_en. I’m very happy to spread my thought to non-Japanese readers.