Results 51 to 60 of about 186,232 (291)
An approximation algorithm for the generalized minimum spanning tree problem with bounded cluster size [PDF]
, 2001 Given a complete undirected graph with the nodes partitioned into m node sets called clusters, the Generalized Minimum Spanning Tree problem denoted by GMST is to find a minimum-cost tree which includes exactly one node from each cluster.
Kern, W., Pop, P.C., Still, G.J.
core +1 more source
Optimal Random Matchings, Tours, and Spanning Trees in Hierarchically Separated Trees [PDF]
, 2013 We derive tight bounds on the expected weights of several combinatorial optimization problems for random point sets of size $n$ distributed among the leaves of a balanced hierarchically separated tree. We consider {\it monochromatic} and {\it bichromatic}
Csaba, Béla +2 more
core +1 more source
Advanced Engineering Materials, EarlyView.This article presents the design, modeling, and characterization of air‐pressure–actuated programmable vibroacoustic metamaterials (PVAMM). The study focuses on leveraging air pressure to dynamically tune resonance frequencies for effective noise attenuation.
William Kaal +2 more
wiley +1 more source
Near-linear Time Algorithm for Approximate Minimum Degree Spanning Trees
, 2020 Given a graph $G = (V, E)$, we wish to compute a spanning tree whose maximum vertex degree, i.e. tree degree, is as small as possible. Computing the exact optimal solution is known to be NP-hard, since it generalizes the Hamiltonian path problem. For the
G Yao +6 more
core +1 more source
Advanced Engineering Materials, EarlyView.Additive manufacturing provides precise control over the placement of continuous fibres within polymer matrices, enabling customised mechanical performance in composite components. This article explores processing strategies, mechanical testing, and modelling approaches for additive manufactured continuous fibre‐reinforced composites.
Cherian Thomas, Amir Hosein Sakhaei
wiley +1 more source
Single-Valued Neutrosophic Minimum Spanning Tree and Its Clustering Method
Journal of Intelligent Systems, 2014 Clustering plays an important role in data mining, pattern recognition, and machine learning. Then, single-valued neutrosophic sets (SVNSs) are a useful means to describe and handle indeterminate and inconsistent information, which fuzzy sets and ...
Ye Jun
doaj +1 more source
Bioinspired Shape‐Memory Hook Fasteners With Programmable Interlocking and Silent Release
Advanced Engineering Materials, EarlyView.Bioinspired hook fasteners made from epoxy shape‐memory polymers are shown to switch between strong, secure attachment and gentle, silent release when heated. By combining programmable geometry and material response, these adaptive fasteners outperform commercial systems in strength and noise control, enabling new solutions for robotics, medical ...
Maria I. Vallejo Ciro +3 more
wiley +1 more source
Reliable Route Selection for Wireless Sensor Networks with Connection Failure Uncertainties
Sensors, 2021 For wireless sensor networks (WSN) with connection failure uncertainties, traditional minimum spanning trees are no longer a feasible option for selecting routes.
Jianhua Lyu +3 more
doaj +1 more source
Spanning trees with many leaves: new extremal results and an improved FPT algorithm [PDF]
, 2006 We present two lower bounds for the maximum number of leaves in a spanning tree of a graph. For connected graphs without triangles, with minimum degree at least three, we show that a spanning tree with at least (n+4)/3 leaves exists, where n is the ...
Bonsma, P.S.
core +2 more sources
Low-Degree Spanning Trees of Small Weight [PDF]
, 1996 The degree-d spanning tree problem asks for a minimum-weight spanning tree in which the degree of each vertex is at most d. When d=2 the problem is TSP, and in this case, the well-known Christofides algorithm provides a 1.5-approximation algorithm ...
Balaji Raghavachari +3 more
core +6 more sources