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.
코드
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
https://github.com/Chenyang-1995/Online-Steiner-Tree
공식 코드https://github.com/adampolak/steiner-tree-with-predictions
공식 코드Approximation Algorithms for Combinatorial Optimization with Predictions
https://github.com/carlossshi/neuroprim
공식 코드NeuroPrim: An Attention-based Model for Solving NP-hard Spanning Tree Problems
https://github.com/cdslabamotong/qrts
공식 코드Query-decision Regression between Shortest Path and Minimum Steiner Tree
https://github.com/daajoe/dynasp
공식 코드DynASP2.5: Dynamic Programming on Tree Decompositions in Action
https://github.com/deepsteiner/deepsteiner
공식 코드Deep-Steiner: Learning to Solve the Euclidean Steiner Tree Problem
https://github.com/sher222/Physarum-Swarm-Steiner-Algo
공식 코드출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.