An Efficient ZDD-Based Method for Enumerating All Cost-Bounded Solutions of Graph Problems: Applications to Weighted Vertex Cover and Hamiltonian s-t Path Problems.

Teruyuki Miyamoto, Jun Kawahara, Shin-ichi Minato

Browse the full ICAART paper archive.