Description
Generated sibling-restricted STNs as they could result from a Hierarchical Task Network. Constraints exist between tasks and their children, and between sibling tasks; in addition, a limited number of "landmark" tasks is added which are exempt from this restriction. Branching factor 4–7; tree height 3–7; landmark ratio in [0,0.5]; probably of sibling edge in [0,0.5]. The weights of the constraint arcs are set such that at least one solution exists (i.e. the graph contains no negative cycles and the STN is consistent). This archive contains 121 graphs on 500–625 vertices, 748–1599 edges, upper bound on treewidth 2–128. Parent item: Benchmark instances for experiments in ["Computing All-Pairs Shortest Paths by Leveraging Low Treewidth" (paper, 2012)]
| Date made available | 9 Mar 2012 |
|---|---|
| Publisher | TU Delft - 4TU.ResearchData |
| Date of data production | 9 Mar 2012 - 24 Jul 2020 |
-
Computing all-pairs shortest paths by leveraging low treewidth
Planken, L., de Weerdt, M. & van der Krogt, P., 2012, In: The Journal of Artificial Intelligence Research. 43, p. 353-388 36 p.Research output: Contribution to journal › Article › Scientific › peer-review
-
Computing all-pairs shortest paths by leveraging low treewidth
Planken, L., de Weerdt, M. & van der Krogt, R., 2011, Proceedings 21st International Conference on Automated Planning and Scheduling. Helmert, M. & Edelkamp, S. (eds.). Palo Alto, CA, USA: American Association for Artificial Intelligence (AAAI), p. 170-177 8 p.Research output: Chapter in Book/Conference proceedings/Edited volume › Conference contribution › Scientific › peer-review
Cite this
- DataSetCite