Zobrazeno 1 - 10
of 1 188 422
pro vyhledávání: '"A, Steiner"'
Autor:
Peter Wegele
Max Steiner is one of the greatest—not to mention most prolific—composers of the Golden Age of Hollywood. The winner of three Academy Awards, Steiner's credits include King Kong, The Informer, Gone with the Wind, Now, Voyager, Since You Went Away
Autor:
Fujita, Misa1,2 (AUTHOR) m-fujita@sist.chukyo-u.ac.jp, Shimada, Yutaka3 (AUTHOR), Kimura, Takayuki4 (AUTHOR), Ikeguchi, Tohru2,5 (AUTHOR)
Publikováno v:
PLoS ONE. 6/6/2024, Vol. 19 Issue 6, p1-16. 16p.
Autor:
Stepanova, E. I.1 (AUTHOR) ekfila@gmail.com
Publikováno v:
Journal of Mathematical Sciences. Nov2023, Vol. 276 Issue 3, p417-422. 6p.
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
Motivated by a repair problem for fractional repetition codes in distributed storage, each block of any Steiner quadruple system (SQS) of order $v$ is partitioned into two pairs. Each pair in such a partition is called a nested design pair and its mu
Externí odkaz:
http://arxiv.org/abs/2410.14417
We study a special case of the Steiner Tree problem in which the input graph does not have a minor model of a complete graph on 4 vertices for which all branch sets contain a terminal. We show that this problem can be solved in $O(n^4)$ time, where $
Externí odkaz:
http://arxiv.org/abs/2410.06793
Autor:
Bhanja, Koustav
Let $G=(V,E)$ be an undirected weighted graph on $n=|V|$ vertices and $S\subseteq V$ be a Steiner set. Steiner mincut is a well-studied concept, which provides a generalization to both (s,t)-mincut (when $|S|=2$) and global mincut (when $|S|=n$). Her
Externí odkaz:
http://arxiv.org/abs/2409.17715
Autor:
García-Castellanos, Alejandro, Medbouhi, Aniss Aiman, Marchetti, Giovanni Luca, Bekkers, Erik J., Kragic, Danica
We propose HyperSteiner -- an efficient heuristic algorithm for computing Steiner minimal trees in the hyperbolic space. HyperSteiner extends the Euclidean Smith-Lee-Liebman algorithm, which is grounded in a divide-and-conquer approach involving the
Externí odkaz:
http://arxiv.org/abs/2409.05671
The Obstacle Avoiding Rectilinear Steiner Minimum Tree (OARSMT) problem, which seeks the shortest interconnection of a given number of terminals in a rectilinear plane while avoiding obstacles, is a critical task in integrated circuit design, network
Externí odkaz:
http://arxiv.org/abs/2410.18832