scispace - formally typeset
Search or ask a question
Topic

Minimum weight

About: Minimum weight is a research topic. Over the lifetime, 2002 publications have been published within this topic receiving 28244 citations.


Papers
More filters
Proceedings ArticleDOI
Juan A. Garay1, Shay Kutten1, David Peleg
03 Nov 1993
TL;DR: This paper proposes that a more sensitive parameter is the network's diameter Diam, and provides a distributed minimum-weight spanning tree algorithm whose time complexity is sub-linear in n, but linear in Diam (specifically, O(Diam+n/sup 0.614/)).
Abstract: This paper considers the question of identifying the parameters governing the behavior of fundamental global network problems. Many papers on distributed network algorithms consider the task of optimizing the running time successful when an O(n) bound is achieved on an n-vertex network. We propose that a more sensitive parameter is the network's diameter Diam. This is demonstrated in the paper by providing a distributed minimum-weight spanning tree algorithm whose time complexity is sub-linear in n, but linear in Diam (specifically, O(Diam+n/sup 0.614/)). Our result is achieved through the application of graph decomposition and edge elimination techniques that may be of independent interest. >

104 citations

Journal ArticleDOI
TL;DR: It is shown that P leaves the (2q + 2, q + 1) code in the family invariant, and that P{I, −I} is isomorphic to PGL2(q), and that a Hadamard matrix is left invariant by the group P described above.

102 citations

Journal ArticleDOI
TL;DR: In this paper, a randomized algorithm for finding a minimum weight loop cutset in a Bayesian network with high probability is presented, with probability at least 1 - (1 - 1/6k)c6k, where c > 1 is a constant specified by the user.
Abstract: We show how to find a minimum weight loop cutset in a Bayesian network with high probability. Finding such a loop cutset is the first step in the method of conditioning for inference. Our randomized algorithm for finding a loop cutset outputs a minimum loop cutset after O(c 6kkn) steps with probability at least 1 - (1 - 1/6k)c6k, where c > 1 is a constant specified by the user, k is the minimal size of a minimum weight loop cutset, and n is the number of vertices. We also show empirically that a variant of this algorithm often finds a loop cutset that is closer to the minimum weight loop cutset than the ones found by the best deterministic algorithms known.

102 citations

Journal ArticleDOI
TL;DR: In this article, the effect of multiple load conditions on the optimum geometrical configurations of planar trusses is investigated, and a general configuration is established by considering all truss components connecting the nodal points of a rectangular gridwork of possible joint locations.
Abstract: The effect of multiple (independent) load conditions on the optimum geometrical configurations of planar trusses is investigated. A general configuration is established by considering all truss components connecting the nodal points of a rectangular gridwork of possible joint locations. This general design is modified through use of a steepest descent nonlinear programming algorithm. Unnecessary components are dropped from the configuration until a truss of minimum weight is obtained. Modifications of joint locations through changes in the nodal pattern are also considered. For the particular design examples investigated, statically determinate trusses were found to exist which are lighter in weight than indeterminate trusses.

99 citations

01 Dec 1980
TL;DR: In this paper, approximation concepts and dual method algorithms are combined to create a method for minimum weight design of structural systems, which is successfully extended to deal with pure discrete and mixed continuous discrete design variable problems.
Abstract: Approximation concepts and dual method algorithms are combined to create a method for minimum weight design of structural systems. Approximation concepts convert the basic mathematical programming statement of the structural synthesis problem into a sequence of explicit primal problems of separable form. These problems are solved by constructing explicit dual functions, which are maximized subject to nonnegativity constraints on the dual variables. It is shown that the joining together of approximation concepts and dual methods can be viewed as a generalized optimality criteria approach. The dual method is successfully extended to deal with pure discrete and mixed continuous-discrete design variable problems. The power of the method presented is illustrated with numerical results for example problems, including a metallic swept wing and a thin delta wing with fiber composite skins.

98 citations


Network Information
Related Topics (5)
Upper and lower bounds
56.9K papers, 1.1M citations
76% related
Time complexity
36K papers, 879.5K citations
73% related
Numerical analysis
52.2K papers, 1.2M citations
73% related
Optimization problem
96.4K papers, 2.1M citations
73% related
Polynomial
52.6K papers, 853.1K citations
72% related
Performance
Metrics
No. of papers in the topic in previous years
YearPapers
202321
202239
202153
202051
201966
201858