Results 291 to 300 of about 2,827,443 (335)
Some of the next articles are maybe not open access.
Bounds on the minimum support weights
IEEE Transactions on Information Theory, 1995The authors derive a number of bounds that generalize known bounds of linear codes involving: (1) \(n\), the length of a linear code \(C\), (2) \(k\), the dimension of a linear code over \(\text{GF} (q)\), (3) \(d_r\), the \(r\)-th minimum support weight.
Øyvind Ytrehus +3 more
openaire +2 more sources
On Minimum- and Maximum-Weight Minimum Spanning Trees with Neighborhoods [PDF]
Theory of Computing Systems, 2013 We study optimization problems for the Euclidean Minimum Spanning Tree (MST) problem on imprecise data. To model imprecision, we accept a set of disjoint disks in the plane as input. From each member of the set, one point must be selected, and the MST is computed over the set of selected points.
Akitoshi Kawamura +6 more
openaire +1 more source
Minimum Weight Triangulations [PDF]
, 1998 A triangulation of a given set S of n points in the plane is a maximal set of non-crossing line segments (called edges) which have both endpoints in S. A triangulation partitions the interior of the convex hull of the given point set into triangles.
openaire +1 more source
Solving the minimum‐weighted coloring problem
Networks, 2001AbstractWeighted coloring is a generalization of the well‐known vertex (unweighted) coloring for which a number of exact algorithms have been presented in the literature. We are not aware of any optimal method specifically designed for the minimum‐weighted coloring problem on arbitrary graphs.
CARAMIA M., DELL'OLMO, Paolo
openaire +2 more sources
Minimum weight concrete platforms
Proceedings of Offshore Europe Conference, 1977SYNOPSIS A design computer model has been devised which, for given functional requirements and location site criteria, determines the dimensions and structural thickness of the lightest cuboid caisson for a chosen draught and adequate floating stability of the platform during submergence. The deck and towers assumed
T. Ridley, AW Malone
openaire +2 more sources
Drawing outerplanar minimum weight triangulations
Information Processing Letters, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
W. Lenhart, LIOTTA, Giuseppe
openaire +3 more sources
On the minimum weights of compression structures
International Journal of Solids and Structures, 1999zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Triangulations without Minimum-Weight Drawing
Information Processing Letters, 2000It is known that some triangulation graphs admit straight-line drawings realizing certain characteristics, e.g., greedy triangulation, minimumweight triangulation, Delaunay triangulation, etc.. Lenhart and Liotta [12] in their pioneering paper on "drawable" minimum-weight triangulations raised an open problem: 'Does every triangulation graph whose ...
Chin, FY, Wang, CA, Yang, B
openaire +6 more sources
Minimum Weight of a Sandwich Panel
Journal of Aerospace Engineering, 1988The least‐weight problem of a sandwich panel with a truncated, hollow, hexagonal core, and subjected to a given bending moment along each edge is analyzed in this paper. In order to meet the practical manufacturing requirements and be within allowable stress limits, constraints are placed on the geometrical dimensions of the structural parts of the ...
Charles E. S. Ueng, T. L. Liu
openaire +2 more sources
Counting Minimum Weight Arborescences
Algorithmica, 2018In a directed graph $$D = (V, A)$$ with a specified vertex $$r \in V$$
Koyo Hayashi, Satoru Iwata
openaire +2 more sources