— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
In this paper we present a family of algorithms for estimating stream weights for dynamic Bayesian networks with multiple observation streams. For the 2 stream case, we present a ...
We present an NC approximation algorithm for the weighted matching problem in graphs with an approximation ratio of (1 - ). This improves the previously best approximation ratio of...
Real-world, multiple-typed objects are often interconnected, forming heterogeneous information networks. A major challenge for link-based clustering in such networks is its potent...
Abstract. We consider the distributed construction of a minimum weight 2edge-connected spanning subgraph (2-ECSS) of a given weighted or unweighted graph. A 2-ECSS of a graph is a ...
Sven Oliver Krumke, Peter Merz, Tim Nonner, Kathar...