Learn More
We present new efficient deterministic and randomized distributed algorithms for decomposing a graph with n nodes into a disjoint set of connected clusters with radius at most k − 1 and having O(n 1+1/k) intercluster edges. We show how to implement our algorithms in the distributed CON GEST model of computation, i.e., limited message size, which improves(More)
The paper presents a deterministic distributed algorithm that, given k &#8805; 1, constructs in k rounds a (2k-1,0)-spanner of O(k n<sup>1+1/k</sup>) edges for every n-node unweighted graph. (If n is not available to the nodes, then our algorithm executes in 3k-2 rounds, and still returns a (2k-1,0)-spanner with O(k n<sup>1+1/k</sup>) edges.) Previous(More)
Recently, there has been a renewed interest in decomposition-based approaches for evolutionary multiobjective optimization. However, the impact of the choice of the underlying scalarizing function(s) is still far from being well understood. In this paper, we investigate the behavior of different scalarizing functions and their parameters. We thereby(More)
The idea of multiobjectivization is to reformulate a single-objective problem as a multiobjective one. In one of the scarce studies proposing this idea for problems in <i>continuous</i> domains, the distance to the closest neighbor (DCN) in the population of a multiobjective algorithm has been used as the additional (dynamic) second objective. As no(More)
This paper concerns the efficient construction of sparse and low stretch spanners for unweighted arbitrary graphs with n nodes. All previous deterministic distributed algorithms, for constant stretch spanners of o(n 2) edges, have a running time Ω (n) for some constant > 0 depending on the stretch. Our deterministic distributed algorithms construct constant(More)
An (α, β)-spanner of a graph G is a subgraph H that approximates distances in G within a multiplicative factor α and an additive error β, ensuring that for any two nodes u, v, dH(u, v) ≤ α · dG(u, v) + β. This paper concerns algorithms for the distributed deterministic construction of a sparse (α, β)-spanner H for a given graph G and distortion parameters α(More)
The paper deals with radio network distributed algorithms where initially no information about node degrees is available. We show that the lack of such an information affects the time complexity of existing fundamental algorithms by only a polylogarithmic factor. More precisely, given an n-node graph modeling a multi-hop radio network, we provide a O(log 2(More)