We present a two-phase heuristic for designing a capacitated degree constrained min sum arborescence. For a given directed graph G(V,E) where V={0, 1,…,n} with nonnegative costs Cij for each (i,j)

Distributed processing has been motivated by many objectives. Among these are a desire to share resources, reduce communications costs (as compared to a centralized processing scheme), increase performance and decrease response time by partitioning tasks and achieve higher system availability...

This document is a collection of 157 abstracts received during the National Seminar on "Integrated Rural Development and Management: Issues, Strategies and Policy Options" held at the IRDM Faculty Centre of Ramakrishna Mission Vivekananda University during 17-18 December, 2010