Search Results

This paper presents two algorithms to construct minimum weight spanning trees with approximately minimum degree. The first method gives a spanning tree whose ma

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

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

This volume contains the papers presented at the 8th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2005) an

During the last three decades, breakthroughs in computer technology have made a tremendous impact on optimization. In particular, parallel computing has made it