Journal ArticleDOI
A fast algorithm for Steiner trees
Reads0
Chats0
TLDR
The heuristic algorithm has a worst case time complexity of O(¦S¦¦V¦2) on a random access computer and it guarantees to output a tree that spans S with total distance on its edges no more than 2(1−1/l) times that of the optimal tree.Abstract:
Given an undirected distance graph G=(V, E, d) and a set S, where V is the set of vertices in G, E is the set of edges in G, d is a distance function which maps E into the set of nonnegative numbers and S?V is a subset of the vertices of V, the Steiner tree problem is to find a tree of G that spans S with minimal total distance on its edges. In this paper, we analyze a heuristic algorithm for the Steiner tree problem. The heuristic algorithm has a worst case time complexity of O(¦S¦¦V¦ 2) on a random access computer and it guarantees to output a tree that spans S with total distance on its edges no more than 2(1?1/l) times that of the optimal tree, where l is the number of leaves in the optimal tree.read more
Citations
More filters
Journal ArticleDOI
Exploring the SARS-CoV-2 virus-host-drug interactome for drug repurposing
Sepideh Sadegh,Julian Matschinske,David Blumenthal,Gihanna Galindez,Tim Kacprowski,Markus List,Reza Nasirigerdeh,Mhaned Oubounyt,Andreas Pichlmair,Tim Daniel Rose,Marisol Salgado-Albarrán,Marisol Salgado-Albarrán,Julian Späth,Alexey Stukalov,Nina K. Wenke,Kevin Yuan,Josch K. Pauling,Jan Baumbach,Jan Baumbach +18 more
TL;DR: CoVex renders COVID-19 drug research systems-medicine-ready by giving the scientific community direct access to network medicine algorithms and investigates recent hypotheses on a systems biology level to explore mechanistic virus life cycle drivers, and to extract drug repurposing candidates.
Book ChapterDOI
A Graph-Based Approach to Learn Semantic Descriptions of Data Sources
TL;DR: This paper uses a graph-based approach to hypothesize a rich semantic description of a new target source from a set of known sources that have been modeled over the same domain ontology.
Proceedings ArticleDOI
Routing, Anycast, and Multicast for Mesh and Sensor Networks
Roland Flury,Roger Wattenhofer +1 more
TL;DR: It is argued that the connectivity of such networks is well captured by a constant doubling metric and present a constant stretch multicast algorithm through which any network node u can send messages to an arbitrary receiver set U.
Proceedings ArticleDOI
Joint NFV placement and routing for multicast service on SDN
TL;DR: An algorithm is presented to solve the problem of guaranteeing that the multicast flows traverse through the services chain before reaching the end user is still an open problem.
Proceedings ArticleDOI
Bandwidth efficient multicast routing in multi-channel multi-radio wireless mesh networks
TL;DR: A multicast routing algorithm for MCMR WMNs that takes into account the wireless broadcast advantage and channel diversity in order to minimize the amount of network bandwidth consumed by the routing tree is proposed.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Book ChapterDOI
Reducibility Among Combinatorial Problems
TL;DR: The work of Dantzig, Fulkerson, Hoffman, Edmonds, Lawler and other pioneers on network flows, matching and matroids acquainted me with the elegant and efficient algorithms that were sometimes possible.
Reducibility Among Combinatorial Problems.
TL;DR: Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.
Journal ArticleDOI
Algorithm 97: Shortest path
TL;DR: The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.
Journal ArticleDOI
Steiner Minimal Trees
E. N. Gilbert,H. O. Pollak +1 more
TL;DR: A Steiner minimal tree for given points in the plane is a tree which interconnects these points using lines of shortest possible total length as mentioned in this paper, where the length of the shortest possible line is chosen.