cleaver
发表于 2025-4-1 04:54:33
A PTAS for the Metric Case of the Minimum Sum-Requirement Communication Spanning Tree Problem minimum communication spanning tree problem (.). Given an undirected graph . = (.,.) with non-negative lengths .(.) associated to the edges satisfying the triangular inequality and non-negative routing weights .(.) associated to nodes . ∈ ., the objective is to find a spanning tree . of ., that min