XII Preface solution as efficiently as possible. Most of the problems we treat have a good
algorithmic solution, but we also show how even difficult problems can be treated (for …

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

This handbook provides an up-to-date compendium of fundamental computer science
topics, techniques, and applications. Along with updating and revising many of the existing …

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 …

When you think about how far and fast computer science has progressed in recent years, it's
not hard to conclude that a seven-year old handbook may fall a little short of the kind of …

This survey covers topics in geometric network design theory. The problem is easy to state:
connect a collection of n sites by a “good” network. For instance, one may wish to connect …

Algorithms for Wireless Sensor Networks - Sartaj Sahni, Xiaochun Xu, 2005 Skip to main
content Intended for healthcare professionals Sage Journals Home Search this journal Search …

Information Processing On the minimum diameter spanning tree problem Page 1 ELSEVIER
Information Processing Letters 53 (1995) 109-111 Information Processing Letters On the …

One of the fundamental problems in graph theory is to compute a minimum weight spanning
tree. In this paper, a variant of spanning trees, called the minimum labeling spanning tree, is …

Multicast services can be provided either as a basic network service or as an application-
layer service. Higher level multicast implementations often provide more sophisticated …