Zobrazeno 1 - 10
of 77 894
pro vyhledávání: '"Šteiner P"'
The Steiner Forest problem is an important generalization of the Steiner Tree problem. We are given an undirected graph with nonnegative edge costs and a collection of pairs of vertices. The task is to compute a cheapest forest with the property that
Externí odkaz:
http://arxiv.org/abs/2412.06518
The Euclidean Steiner Tree Problem (EST) seeks a minimum-cost tree interconnecting a given set of terminal points in the Euclidean plane, allowing the use of additional intersection points. In this paper, we consider two variants that include an addi
Externí odkaz:
http://arxiv.org/abs/2412.07046
Autor:
Barbina, Silvia, Casanovas, Enrique
A free Steiner quasigroup is a free object in the variety of Steiner quasigroups. Free Steiner quasigroups are characterised by the existence of a levelled construction that starts with a free base - that is, a set of elements none of which is a prod
Externí odkaz:
http://arxiv.org/abs/2412.06055
Multipartite entangled states, particularly Greenberger--Horne--Zeilinger (GHZ) and other graph states, are important resources in multiparty quantum network protocols and measurement-based quantum computing. We consider the problem of generating suc
Externí odkaz:
http://arxiv.org/abs/2412.04252
We perform a rigorous analysis of the $\pi K$ scattering at an unphysical pion mass $391~$MeV using the Roy-Steiner equations, which satisfy unitarity, analyticity and crossing symmetry, for the first time. Stable solutions of the Roy-Steiner equatio
Externí odkaz:
http://arxiv.org/abs/2412.03374
Autor:
Parque, Victor
Euclidean Steiner trees are relevant to model minimal networks in real-world applications ubiquitously. In this paper, we study the feasibility of a hierarchical approach embedded with bundling operations to compute multiple and mutually disjoint Euc
Externí odkaz:
http://arxiv.org/abs/2412.01094
Autor:
Mario, Galici, Filippone, Giuseppe
Publikováno v:
Discrete Math. 348, No. 1, Article ID 114294, 13 p. (2025)
The concept of Schreier extensions of loops was introduced in the general case in [11] and, more recently, it has been explored in the context of Steiner loops in [6]. In the latter case, it gives a powerful method for constructing Steiner triple sys
Externí odkaz:
http://arxiv.org/abs/2411.16307
We study the metric Steiner tree problem in the sublinear query model. In this problem, for a set of $n$ points $V$ in a metric space given to us by means of query access to an $n\times n$ matrix $w$, and a set of terminals $T\subseteq V$, the goal i
Externí odkaz:
http://arxiv.org/abs/2411.09059
Autor:
Zheng, Michael
We establish an upper bound on the minimum codegree necessary for the existence of spanning, fractional Steiner triple systems in $3$-uniform hypergraphs. This improves upon a result by Lee in 2023. In particular, together with results from Lee's pap
Externí odkaz:
http://arxiv.org/abs/2411.07981
Autor:
Chekuri, Chandra, Jain, Rhea
We consider Directed Steiner Forest (DSF), a fundamental problem in network design. The input to DSF is a directed edge-weighted graph $G = (V, E)$ and a collection of vertex pairs $\{(s_i, t_i)\}_{i \in [k]}$. The goal is to find a minimum cost subg
Externí odkaz:
http://arxiv.org/abs/2410.17403