Optimal deterministic algorithm for the hammock (2,2)-poset cover problem
The Poset Cover Problem is a hard optimization problem that has application to problems in data mining where the goal is to come up with directed acyclic networks that characterize the ordering pattern of a given set of sequential data. There have been variations to the problem, one of which is the...
| Những tác giả chính: | , |
|---|---|
| Định dạng: | Analytics |
| Ngôn ngữ: | English |
| Được phát hành: |
2018.
|
| Những chủ đề: | |
| Truy cập trực tuyến: | https://forms.gle/KZjBv7aRtY6jiL5E9 |