Average-case complexity of a branch-and-bound algorithm for MIN DOMINATING SET

Tom Denat,Ararat Harutyunyan,Nikolaos Melissinos,Vangelis Th. Paschos

DISCRETE APPLIED MATHEMATICS（2024）

引用 24|浏览23

暂无评分

摘要

The average-case complexity of a branch-and-bound algorithm for MIN DOMINATING SET problem in random graphs in the G(n, p) model is studied. We identify phase transitions between subexponential and exponential average-case complexities, depending on the growth of the probability p with respect to the number n of nodes. (c) 2023 Elsevier B.V. All rights reserved.

查看译文

关键词

Approximation scheme,Subset-sums ratio,Knapsack problems,Combinatorial optimization

AI 理解论文

溯源树

样例

生成溯源树，研究论文发展脉络

Chat Paper

正在生成论文摘要