Software-defined networking (SDN) is an emerging paradigm that has become increasingly
popular in recent years. The core idea is to separate the control and data planes, allowing …

The Steiner tree problem (STP) in graphs is one of the most studied problems in
combinatorial optimization. Since its inception in 1970, numerous articles published in the …

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

It is widely realized that the integration of database and information retrieval techniques will
provide users with a wide range of high quality services. In this paper, we study processing …

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 …

Given an arc-weighted directed graph G=(V, A,/spl lscr/) and a pair of nodes s, t, we seek to
find an st walk of length at most B that maximizes some given function f of the set of nodes …

We consider the problem of establishing minimum-cost multicast connections over coded
packet networks, ie, packet networks where the contents of outgoing packets are arbitrary …

Assume a network (V, E) where a subset of the nodes in V are active. We consider the
problem of selecting a set of k active nodes that best explain the observed activation state …

We investigate the critical end point of QCD with two flavours of light dynamical quarks at
finite lattice cutoff a= 1/4 T using a Taylor expansion of the baryon number susceptibility. We …