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.

평가 결과

데이터셋과 평가 조건을 선택해 성능·논문·코드를 비교하세요. 보존된 Papers with Code 기록으로, 최신 순위는 아닙니다.

아직 연결된 자료가 없습니다.