Question

In the lecture, the problem Weighted Interval Selection is formulated as an instance of longest path in DAG. There is another formulation with a different DAG whose nodes are endpoints of the intervals (we may assume all intervals are distinct). Construct such DAG by describing the edges and their lengths and argue that an optimal solution can ve derived by some longest path in this DAG

Name: in the lecture the problem weighted interval selection is formulated as an instance of longest path in dag there is another formulation with a different dag whose nodes are endpoints of the 30702
Uploaded: 2019-10-25T18:00:35-08:00
Duration: 1 min 57 s
Channel: Wen Zheng
Description: in the lecture the problem weighted interval selection is formulated as an instance of longest path in dag there is another formulation with a different dag whose nodes are endpoints of the 30702

          In the lecture, the problem Weighted Interval Selection is formulated as an instance of longest path in DAG. There is another formulation with a different DAG whose nodes are endpoints of the intervals (we may assume all intervals are distinct). Construct such DAG by describing the edges and their lengths and argue that an optimal solution can ve derived by some longest path in this DAG

Added by Kristine J.

Computer Science and Information Technology

Trishna Knowledge Systems 2018 Edition

Thanks for your feedback!

In the lecture, the problem Weighted Interval Selection is formulated as an instance of longest path in DAG. There is another formulation with a different DAG whose nodes are endpoints of the intervals (we may assume all intervals are distinct). Construct such DAG by describing the edges and their lengths and argue that an optimal solution can ve derived by some longest path in this DAG