Publisher Summary Trees are particular types of graphs that on the surface appear to be
quite specialized, so much so that they might not seem to merit in-depth investigation. Tree …

ABSTRACT A Wireless Sensor Network (WSN) is actually composed of a large number of
very small in size, low-cost, low-power, multifunctional sensor nodes that are densely …

Discrete optimization problems are everywhere, from traditional operations research
planning (scheduling, facility location and network design); to computer science databases; …

The dominating set problem in graphs asks for a minimum size subset of vertices with the
following property: each vertex is required to be either in the dominating set, or adjacent to …

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

We give the first approximation algorithm for the generalized network Steiner problem, a
problem in network design. An instance consists of a network with link-costs and} for each …

We give the first nontrivial approximation algorithms for the Steiner tree problem and the
generalized Steiner network problem on general directed graphs. These problems have …

Given a weighted graph with some subsets of vertices called groups, the group Steiner tree
problem is to find a minimum-weight subgraph which contains at least one vertex from each …

A natural and well-studied problem in algorithmic graph theory and network optimization is
that of computing a\shortest path" between two nodes, s and t, in a graph whose edges …

To target complex, multi-factorial diseases more effectively, there has been an emerging
trend of multi-target drug development based on network biology, as well as an increasing …