.png){kind=icon}
返回
Integer programming formulations for the k-in-a-tree problem in graphs
.png){kind=icon}
PRE
AI
DOI：10.1111/itor.13297.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Chudnovsky and Seymour proposed the Three-in-a-tree algorithm which solves the following problem in polynomial time: given three fixed vertices in a simple finite graph, check whether an induced tree containing these vertices exists. In this paper, we deal with a generalization of this problem, referred to henceforth as k-in-a-tree. The k-in-a-tree checks whether a graph contains an induced tree spanning k given vertices. When k is part of the input, the problem is known to be NP-complete. If k = 4 is a fixed given number, its complexity is an open question, although there are efficient algorithms for restricted cases such as claw-free graphs, graphs with a girth of at least k and chordal graphs. We present mixed-integer programming formulations for this problem, and we show that instances with up to 25,000 vertices can be solved in reasonable computational time.
Keyword:
k-in-a-tree
induced subgraphs
integer programming
期刊
IF:
2.9
论文数:
1.8K
被引数:
3.7K
机构
引用论文
Maximum weighted induced forests and trees: new formulations and a computational comparative review
OAAI
OAAI分享收藏Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem用于最小加权反馈顶点集问题的紧凑公式和基于迭代局部搜索的matheuristic
PREAI
分享收藏A BRANCH-AND-CUT ALGORITHM FOR THE RESOLUTION OF LARGE-SCALE SYMMETRICAL TRAVELING SALESMAN PROBLEMS.png)
SIAM REVIEW
SIAM REVIEWIF6.1
PREAI
分享收藏THE TRAVELING SALESMAN PROBLEM - AN OVERVIEW OF EXACT AND APPROXIMATE ALGORITHMS旅行商问题-精确算法和近似算法的概述
PREAI
分享收藏Induction and elimination of bulky benzo[a]pyrene-related DNA adducts and 8-oxodGuo in mussels Mytilus galloprovincialis exposed in vivo to B[a]P-contaminated feed体内暴露于B[a]P污染的饲料中的贻贝Mytilus galloprovincialis中庞大的苯并 [a] re相关DNA加合物和8-氧代果的诱导和消除OAAI
OAAI分享收藏
分享收藏
查看更多内容