Titlebook: Algorithms and Discrete Applied Mathematics; First International Sumit Ganguly,Ramesh Krishnamurti Conference proceedings 2015 Springer In

cleaver

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