Results 1  10
of
6,019
A distributed algorithm for minimumweight spanning trees
, 1983
"... A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm and exchange ..."
Abstract

Cited by 435 (3 self)
 Add to MetaCart
A distributed algorithm is presented that constructs he minimumweight spanning tree in a connected undirected graph with distinct edge weights. A processor exists at each node of the graph, knowing initially only the weights of the adjacent edges. The processors obey the same algorithm
Minimum weight pseudotriangulations
 Proc. 24th Int. Conf. Foundations Software Tech. Theoretical Comput. Sci. (FSTTCS’04), volume 3328 of Lecture Notes in Computer Science
, 2004
"... Abstract. We consider the problem of computing a minimum weight pseudotriangulation of a set S of n points in the plane. We first present an O(n log n)time algorithm that produces a pseudotriangulation of weight O(log n·wt(M(S))) which is shown to be asymptotically worstcase optimal, i.e., there ..."
Abstract

Cited by 8 (0 self)
 Add to MetaCart
Abstract. We consider the problem of computing a minimum weight pseudotriangulation of a set S of n points in the plane. We first present an O(n log n)time algorithm that produces a pseudotriangulation of weight O(log n·wt(M(S))) which is shown to be asymptotically worstcase optimal, i
Computing MinimumWeight Perfect Matchings
 INFORMS
, 1999
"... We make several observations on the implementation of Edmonds’ blossom algorithm for solving minimumweight perfectmatching problems and we present computational results for geometric problem instances ranging in size from 1,000 nodes up to 5,000,000 nodes. A key feature in our implementation is the ..."
Abstract

Cited by 98 (2 self)
 Add to MetaCart
We make several observations on the implementation of Edmonds’ blossom algorithm for solving minimumweight perfectmatching problems and we present computational results for geometric problem instances ranging in size from 1,000 nodes up to 5,000,000 nodes. A key feature in our implementation
Approximating the Minimum Weight Triangulation
, 1991
"... We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtrees. In O(n log n) time we can compute a triangulation with O(n) new points, and no obtuse triangles, that approximat ..."
Abstract

Cited by 9 (4 self)
 Add to MetaCart
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtrees. In O(n log n) time we can compute a triangulation with O(n) new points, and no obtuse triangles
Construction of minimumweight spanners
 In Proc. of the 12th European Symposium on Algorithms
, 2004
"... Abstract. Spanners are sparse subgraphs that preserve distances up to a given factor in the underlying graph. Recently spanners have found important practical applications in metric space searching andmessage distribution in networks. These applications use some variant of the socalled greedy algori ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
algorithm for constructing the spanner — an algorithm that mimics Kruskal’s minimum spanning tree algorithm. Greedy spanners have nice theoretical properties, but their practical performance with respect to total weight is unknown. In this paper we give an exact algorithm for constructing minimumweight
Planar MinimumWeight Triangulations
, 1995
"... The classic problem of finding a minimumweight triangulation for a given planar straightline graph is considered in this paper. A brief overview of known methods is given in addition to some new results. A parallel greedy triangulation algorithm is presented along with experimental data that sugge ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
The classic problem of finding a minimumweight triangulation for a given planar straightline graph is considered in this paper. A brief overview of known methods is given in addition to some new results. A parallel greedy triangulation algorithm is presented along with experimental data
The minimum weight of dual codes from . . .
, 2006
"... The minimum weight and the nature of the minimumweight vectors of the pary codes from projective planes of order divisible by p was established in the 1960s, at an early stage of the study of these codes. The same cannot be said for the duals of these codes, where, in general, neither the minimum ..."
Abstract
 Add to MetaCart
The minimum weight and the nature of the minimumweight vectors of the pary codes from projective planes of order divisible by p was established in the 1960s, at an early stage of the study of these codes. The same cannot be said for the duals of these codes, where, in general, neither the minimum
On (Pointed) Minimum Weight PseudoTriangulations
"... In this note we discuss some structural properties of minimum weight (pointed) pseudotriangulations. 1 ..."
Abstract
 Add to MetaCart
In this note we discuss some structural properties of minimum weight (pointed) pseudotriangulations. 1
Counting minimum weighted dominating sets
, 2006
"... We show how to count all minimum weighted dominating sets of a graph on n vertices in time O(1.5535 n). ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
We show how to count all minimum weighted dominating sets of a graph on n vertices in time O(1.5535 n).
Minimum weight triangulation is NPhard
 IN PROC. 22ND ANNU. ACM SYMPOS. COMPUT. GEOM
, 2006
"... A triangulation of a planar point set S is a maximal plane straightline graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge lengths. We prove that the decision version of this problem ..."
Abstract

Cited by 42 (0 self)
 Add to MetaCart
A triangulation of a planar point set S is a maximal plane straightline graph with vertex set S. In the minimum weight triangulation (MWT) problem, we are looking for a triangulation of a given point set that minimizes the sum of the edge lengths. We prove that the decision version of this problem
Results 1  10
of
6,019