Results 81 to 90 of about 43,946 (309)

Algorithms for the minimum spanning tree problem with resource allocation

open access: yesOperations Research Perspectives, 2016
We formulate the minimum spanning tree problem with resource allocation (MSTRA) in two ways, as discrete and continuous optimization problems (d-MSTRA/c-MSTRA), prove these to be NP-hard, and present algorithms to solve these problems to optimality.
Seiji Kataoka, Takeo Yamada
doaj   +1 more source

Minimum Monotone Spanning Trees

open access: yes
To appear in Proc. 50th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2025)
Emilio Di Giacomo   +5 more
openaire   +2 more sources

Immunoinflammatory Mechanisms and Biocompatibility of Bioactive Dental Biomaterials: From Fundamental Insights to Clinical Translation

open access: yesAdvanced Healthcare Materials, EarlyView.
Surface‐host dialogue at the implant interface governs biological fate and osseointegration. Surface physicochemical properties of titanium (Ti) dental implants, including microgrooves, nanopatterns, nanotopography, roughness, and wettability, modulate the initial adsorption of proteins and the formation of a dynamic biointerface.
Daniela Moreira Cunha   +9 more
wiley   +1 more source

A fair rule in minimum cost spanning tree problems [PDF]

open access: yes
We study minimum cost spanning tree problems and define a cost sharing rule that satisfies many more properties than other rules in the literature.
Gustavo Bergantiños, Juan Vidal-Puga
core  

Minimum cost arborescences [PDF]

open access: yes, 2009
In this paper, we analyze the cost allocation problem when a group of agents or nodes have to be connected to a source, and where the cost matrix describing the cost of connecting each pair of agents is not necessarily symmetric, thus extending the well ...
Dutta, Bhaskar, Mishra, Debasis
core  

The Minimum Spanning Tree Problem on networks with Neutrosophic numbers [PDF]

open access: yesNeutrosophic Sets and Systems
The minimum spanning tree problem (MSTP) revolves around creating a spanning tree (ST) within a graph/network that incurs the least cost compared to all other potential STs.
Kalyan Adhikary   +2 more
doaj   +1 more source

Bioinspired Adaptive Sensors: A Review on Current Developments in Theory and Application

open access: yesAdvanced Materials, EarlyView.
This review comprehensively summarizes the recent progress in the design and fabrication of sensory‐adaptation‐inspired devices and highlights their valuable applications in electronic skin, wearable electronics, and machine vision. The existing challenges and future directions are addressed in aspects such as device performance optimization ...
Guodong Gong   +12 more
wiley   +1 more source

Beyond Presumptions: Toward Mechanistic Clarity in Metal‐Free Carbon Catalysts for Electrochemical H2O2 Production via Data Science

open access: yesAdvanced Materials, EarlyView.
Metal‐free carbon catalysts enable the sustainable synthesis of hydrogen peroxide via two‐electron oxygen reduction; however, active site complexity continues to hinder reliable interpretation. This review critiques correlation‐based approaches and highlights the importance of orthogonal experimental designs, standardized catalyst passports ...
Dayu Zhu   +3 more
wiley   +1 more source

2D Co‐Mo‐Hydroxide‐Based Multifunctional Material for the Development of H2‐Based Clean Energy Technologies

open access: yesAdvanced Materials, EarlyView.
2D α‐Co(OH)2 interleaved with Mo species displays an appealing dual functionality for the production and use of green hydrogen.Mo incorporation greatly benefits the electrochemical behaviour in Oxygen Evolution Reaction for H2 production, while the magnetocaloric response at liquid H2 temperature paves the way for alternative cryogenic refrigerants ...
Daniel Muñoz‐Gil   +14 more
wiley   +1 more source

Constructive Heuristics for the Minimum Labelling Spanning Tree Problem: a preliminary comparison

open access: yes, 2006
This report studies constructive heuristics for the minimum labelling spanning tree (MLST) problem. The purpose is to find a spanning tree that uses edges that are as similar as possible.
A. Moreno Jose   +7 more
core  

Home - About - Disclaimer - Privacy