We will discuss the (i) Dijkstra's shortest path algorithm and its modifications for finding stable paths and bottleneck paths; (ii) Prim's minimum spanning tree algorithm and its modification for finding all pairs smallest and largest bottleneck paths; (iii) Minimum Steiner tree algorithm to connect a source node to all the receivers of a multicast group; (iv) A node-degree based algorithm to construct an approximate minimum connected dominating set (CDS) for sending information from one node to all other nodes in the network," and (v) Algorithms to find a sequence of link-disjoint, node-disjoint and zone-disjoint multi-path routes in MANETs.

Let |mis(G)| and |mcds(G)| be the size of a maximum independent set and the size of a minimum connected dominating set in the same graph G respectively.

The eleven papers discuss extremal problems for convex polygons, finite algorithms for global minimization of separable concave programs, trust-tech-based global optimization methodology for nonlinear programming, global optimization issues in parametric programming and control, optimization in biomedical research, an overview of advances in global optimization during 2003-2008, software development for global optimization, connected dominating sets in hypergraphs, and global optimization of pessimistic bi-level problems.