Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …

The design of approximation algorithms for spanning tree problems has become an exciting
and important area of theoretical computer science and also plays a significant role in …

We consider the problem of designating hazardous materials routes in and through a major
population center. Initially, we restrict our attention to a minimally connected network (a tree) …

The minimum routing cost tree problem arises when we need to find the tree minimizing the
minimum travel/communication cost, ie, the tree which presents the minimal difference with …

An example network orchestrator includes processing cir cuitry and a memory. The memory
includes instructions that cause the network orchestrator to receive network probe …

This paper presents an algorithm based on Benders decomposition to solve the optimum
communication spanning tree problem. The algorithm integrates within a branch-and-cut …

To meet customer demand, delivery companies are offering an increasing number of time‐
definite services. In this article, we examine the strategic design of delivery networks which …

Abstract Let G=({1,…, n}, E, w) be an undirected graph with nonnegative edge weights w
and let aij be the nonnegative requirement between vertices i and j. For any spanning …

Let G be an undirected graph with nonnegative edge lengths. Given two vertices as sources
and all vertices as destinations, we investigated the problem how to construct a spanning …

Given an undirected graph with nonnegative edge lengths and nonnegative vertex weights,
the routing requirement of a pair of vertices is assumed to be the product of their weights …