We consider the minimum-weight path between any pair of nodes of the n-vertex complete graph in which the weights of the edges are i.i.d. exponentially distributed random variable...
Matching life science ontologies to determine ontology mappings has recently become an active field of research. The large size of existing ontologies and the application of comple...
Anika Gross, Michael Hartung, Toralf Kirsten, Erha...
In this paper, we propose an on-demand distributed clustering algorithm for multi-hop packet radio networks. These types of networks, also known as ad hoc networks, are dynamic in ...
Distributed localization in wireless sensor networks has attracted significant interest in recent years. In this paper, we propose two improvements towards the DV-Hop algorithm: th...
We consider the following Tree-Constrained Bipartite Matching problem: Given two rooted trees T1 = (V1, E1), T2 = (V2, E2) and a weight function w : V1 × V2 → R+, find a maximu...
Stefan Canzar, Khaled M. Elbassioni, Gunnar W. Kla...