Abstract
NBS is a non-parametric bidirectional search algorithm, proved to expand at most twice the number of node expansions required to verify the optimality of a solution. We introduce DVCBS, a new algorithm based on a dynamic vertex cover that aims to further reduce the number of expansions. Unlike NBS, DVCBS does not have any worst-case bound guarantees, but in practice it outperforms NBS in verifying the optimality of solutions.
Original language | English |
---|---|
Title of host publication | Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019 |
Editors | Pavel Surynek, William Yeoh |
Publisher | AAAI press |
Pages | 196-197 |
Number of pages | 2 |
ISBN (Electronic) | 9781577358084 |
State | Published - 2019 |
Externally published | Yes |
Event | 12th International Symposium on Combinatorial Search, SoCS 2019 - Napa, United States Duration: 16 Jul 2019 → 17 Jul 2019 |
Publication series
Name | Proceedings of the 12th International Symposium on Combinatorial Search, SoCS 2019 |
---|
Conference
Conference | 12th International Symposium on Combinatorial Search, SoCS 2019 |
---|---|
Country/Territory | United States |
City | Napa |
Period | 16/07/19 → 17/07/19 |
Bibliographical note
Publisher Copyright:Copyright © 2019, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved.