Papers with Code 아카이브
Steiner Tree Problem
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 0
- 평가표
- 0
- 보존된 평가 기록
- 0
The Steiner tree problem is a computational problem in computer science and graph theory that involves finding the minimum weight subgraph in an undirected graph that connects a given set of terminal vertices. The goal of the Steiner tree problem is to minimize the total weight of the edges in the subgraph, and it is considered NP-hard, meaning that finding the optimal solution is computationally difficult.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Query-decision Regression between Shortest Path and Minimum Steiner Tree
NeuroPrim: An Attention-based Model for Solving NP-hard Spanning Tree Problems
Deep-Steiner: Learning to Solve the Euclidean Steiner Tree Problem
Learning to Prune Instances of Steiner Tree Problem in Graphs
Integrating connection search in graph queries
Submarine Cable Network Design for Regional Connectivity
Learning-Augmented Algorithms for Online Steiner Tree
Vulcan: Solving the Steiner Tree Problem with Graph Neural Networks and Deep Reinforcement Learning
The Power of Many: A Physarum Swarm Steiner Tree Algorithm
Solving Large Steiner Tree Problems in Graphs for Cost-Efficient Fiber-To-The-Home Network Expansion
Computing Steiner Trees using Graph Neural Networks
Solving the Steiner Tree Problem with few Terminals
Devolutionary genetic algorithms with application to the minimum labeling Steiner tree problem
Evolutionary framework for two-stage stochastic resource allocation problems
Solving the Steiner Tree Problem in graphs with Variable Neighborhood Descent
DynASP2.5: Dynamic Programming on Tree Decompositions in Action
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.