a Instituto de Computaçao, Universidade Federal de Fluminense, Rua Passo da Pátria 156, Bloco E, 3 andar, São Domingos, Niterói, RJ, CEP: 24210-240, Brazil Departamento de Ingeniería Informática, Universidad de Santiago de Chile, Av. Ecuador 3659, Santiago, Chile Departamento de Engenharia de Produção, Universidade Federal Fluminense, Rua Passo da Patria 156, Bloco E, 4 andar, CEP: 24210-240, B...

In the article “The minimal spanning tree in a complete graph and a functional limit theorem for trees in a random graph” by Janson [6] it is shown that the minimal weight Wn of a spanning tree in a complete graph Kn with independent, uniformly distributed random weights on the edges has an asymptotic normal distribution. The same holds with exponentially distributed weights with mean 1. The me...

In this paper we propose a hybrid memory adaptive heuristic for solving the Capacitated Minimum Spanning Tree (CMST) problem. We augment the problem formulation with additional non-redundant constraints via use of adaptive memory, to improve upon the performance of an elementary heuristic (the Esau-Williams heuristic). Our methodology is tested against many of the previously reported heuristics...

We analyze the facial structure of the polytope associated to the GMSTP with the aim of nding \good" inequalities to strengthen our previous linear formulations. Several families of inequalities which are facet-inducing for the polytope of the GMSTP are investigated. Our proofs of \facetness" for valid inequalities of the GMSTP polytope use tools developped in [3] and also classical results fro...

We introduce a family of sequential contributions rules for minimum cost spanning tree problems. Each member of the family assigns an agent some part of his immediate connection cost and all of his followers are equally responsible for the remaining part. We characterize the family by imposing the axioms of efficiency, non-negativity, independence of following costs, group independence, and wea...

We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature. Furthermore, we provide an axiomatic characterization based on monotonicity properties.

Henze-Penrose divergence is a non-parametric divergence measure that can be used to estimate a bound on the Bayes error in a binary classification problem. In this paper, we show that a crossmatch statistic based on optimal weighted matching can be used to directly estimate Henze-Penrose divergence. Unlike an earlier approach based on the Friedman-Rafsky minimal spanning tree statistic, the pro...

Previous researches on Text-level discourse parsing mainly made use of constituency structure to parse the whole document into one discourse tree. In this paper, we present the limitations of constituency based discourse parsing and first propose to use dependency structure to directly represent the relations between elementary discourse units (EDUs). The state-of-the-art dependency parsing tec...

This paper presents a lower bound of ~ (D + p n) on the time required for the distributed construction of a minimum-weight spanning tree (MST) in n-vertex networks of diameter D = (logn), in the bounded message model. This establishes the asymptotic near-optimality of existing time-e cient distributed algorithms for the problem, whose complexity is O(D + p n log n).