Application of dynamic programming in the minimal superpermutation problem
We show our attempts to bound the minimal superpermutation on n symbols using dynamic programming, namely a variant of the Held{Karp algorithm. A reduction of the search space by introducing certain restrictions to was also done to improve the running time.
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Final Year Project |
| Language: | English |
| Published: |
Nanyang Technological University
2020
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/139313 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |