We present new algebraic approaches for several wellknown combinatorial problems, including non-bipartite matching, matroid intersection, and some of their generalizations. Our wo...
We present the first parallel algorithm for building a Hausdorff Voronoi diagram (HVD). Our algorithm is targeted towards cluster computing architectures and computes the Hausdor...
Frank K. H. A. Dehne, Anil Maheshwari, Ryan Taylor
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However, the fairness degree should be considered within a scheduling algorithm; rather...
Abstract— In this paper, we proposed a dynamic mobilityassisted MDS-based localization algorithms for sparse mobile sensor network. For sparse networks, the assumption of the exi...
This paper propose a maze routing algorithm based on cellular automata. The aim of this algorithm is find the shortest path between the source cell and the target cell , so that th...