Published April 25, 2001
| Submitted
Report
Open
Recurrence-based Heuristics for the Hamiltonian Path Inclusion and Exclusion and Exclusion Algorithm
- Creators
- Bax, Eric
Abstract
For many problem instances, the inclusion and exclusion formula has many cancellations and symmetries. By imposing a hierarchy on the formula's terms, we develop general reductions for inclusion and exclusion algorithms. We apply these reductions to an algorithm which counts Hamiltonian paths, and we develop a branch and bound algorithm to detect Hamiltonian paths. Then we show how to apply the reductions to other inclusion and exclusion algorithms.
Additional Information
© 1994 California Institute of Technology. Supported by and NSF Fellowship.Attached Files
Submitted - postscript.pdf
Submitted - postscript.ps
Files
postscript.pdf
Files
(370.9 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:25579f622e261784a8593da4e964156a
|
183.5 kB | Download |
|
md5:7a2f732fedec2efb9edaee8ba92a9ce9
|
187.4 kB | Preview Download |
Additional details
- Eprint ID
- 26790
- Resolver ID
- CaltechCSTR:1994.cs-tr-94-11
- NSF Fellowship
- Created
-
2001-04-25Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports
- Series Name
- Computer Science Technical Reports