Most of the proposed algorithms in ad hoc networks assume homogeneous nodes with similar transmission range and capabilities. However, in heterogeneous ad hoc network, it is not ne...
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
Abstract. We describe a method for combining formal program development with a disciplined and documented way of introducing realistic compromises, for example necessitated by reso...
In this work, we performed a comprehensive analysis of the genome organization of eight publicly available cyanobacterial genomes and of the extensively studied Escherichia coli K...
Reliability decisions taken early in system design can bring significant benefits in terms of design quality. This paper presents a 0-1 integer linear programming (ILP) formulatio...