FRINK Linked Data Fragments server

Matches in SemOpenAlex for { <https://semopenalex.org/work/W974563791> ?p ?o ?g. }

• W974563791 endingPage "127" @default.
• W974563791 startingPage "118" @default.
• W974563791 abstract "Given a weighted graph G=(V,E) and a subset R of V, a Steiner tree in G is a tree which spans all vertices in R. The vertices in V∖R are called Steiner vertices. A full Steiner tree is a Steiner tree in which each vertex of R is a leaf. The full Steiner tree problem is to find a full Steiner tree with minimum weight. The bottleneck full Steiner tree problem is to find a full Steiner tree which minimizes the length of the longest edge. The k-bottleneck full Steiner tree problem is to find a bottleneck full Steiner tree with at most k Steiner vertices. The smallest full Steiner tree problem is to find a full Steiner tree with the minimum number of Steiner vertices. We show that the full Steiner tree problem in general graphs cannot be approximated within a factor of O(log2−ε⁡|R|) for any ε>0. We also provide a polynomial-time approximation factor preserving reduction from the full Steiner tree problem to the group Steiner tree problem. Based on that, the first approximation algorithm for the full Steiner tree problem in general graphs is obtained. Moreover, we show that the same hardness result holds for the node-weighted version of the full Steiner tree problem. We prove that it is NP-hard to approximate the k-bottleneck full Steiner tree problem within a factor of 2−ε. The smallest full Steiner tree problem is shown to be NP-complete and does not admit any polynomial-time O((1−ε)ln⁡n)-approximation algorithm. The presented reductions show the connection between the full Steiner tree, the group Steiner tree, and the connected set cover problems. In addition, we present an O(|E|log⁡|V|) time algorithm for the bottleneck full Steiner tree problem which relaxes the assumption, that G is a complete graph, in Chen et al. [7] algorithm." @default.
• W974563791 created "2016-06-24" @default.
• W974563791 creator A5015212072 @default.
• W974563791 creator A5025759208 @default.
• W974563791 creator A5068339422 @default.
• W974563791 date "2015-09-01" @default.
• W974563791 modified "2023-09-27" @default.
• W974563791 title "On the hardness of full Steiner tree problems" @default.
• W974563791 cites W1963899113 @default.
• W974563791 cites W1980288485 @default.
• W974563791 cites W1989076933 @default.
• W974563791 cites W1992573093 @default.
• W974563791 cites W2001352447 @default.
• W974563791 cites W2009976792 @default.
• W974563791 cites W2020427431 @default.
• W974563791 cites W2023370539 @default.
• W974563791 cites W2025940440 @default.
• W974563791 cites W2037655022 @default.
• W974563791 cites W2047723482 @default.
• W974563791 cites W2068598660 @default.
• W974563791 cites W2089847997 @default.
• W974563791 cites W2143996311 @default.
• W974563791 cites W2610052675 @default.
• W974563791 cites W3030774092 @default.
• W974563791 doi "https://doi.org/10.1016/j.jda.2015.05.013" @default.
• W974563791 hasPublicationYear "2015" @default.
• W974563791 type Work @default.
• W974563791 sameAs 974563791 @default.
• W974563791 citedByCount "7" @default.
• W974563791 countsByYear W9745637912017 @default.
• W974563791 countsByYear W9745637912018 @default.
• W974563791 countsByYear W9745637912019 @default.
• W974563791 countsByYear W9745637912020 @default.
• W974563791 countsByYear W9745637912021 @default.
• W974563791 countsByYear W9745637912022 @default.
• W974563791 crossrefType "journal-article" @default.
• W974563791 hasAuthorship W974563791A5015212072 @default.
• W974563791 hasAuthorship W974563791A5025759208 @default.
• W974563791 hasAuthorship W974563791A5068339422 @default.
• W974563791 hasBestOaLocation W9745637911 @default.
• W974563791 hasConcept C100560664 @default.
• W974563791 hasConcept C113174947 @default.
• W974563791 hasConcept C114614502 @default.
• W974563791 hasConcept C118615104 @default.
• W974563791 hasConcept C132525143 @default.
• W974563791 hasConcept C147517495 @default.
• W974563791 hasConcept C148764684 @default.
• W974563791 hasConcept C149635348 @default.
• W974563791 hasConcept C163797641 @default.
• W974563791 hasConcept C197855036 @default.
• W974563791 hasConcept C202750272 @default.
• W974563791 hasConcept C2780513914 @default.
• W974563791 hasConcept C311688 @default.
• W974563791 hasConcept C33923547 @default.
• W974563791 hasConcept C41008148 @default.
• W974563791 hasConcept C76220878 @default.
• W974563791 hasConcept C80899671 @default.
• W974563791 hasConceptScore W974563791C100560664 @default.
• W974563791 hasConceptScore W974563791C113174947 @default.
• W974563791 hasConceptScore W974563791C114614502 @default.
• W974563791 hasConceptScore W974563791C118615104 @default.
• W974563791 hasConceptScore W974563791C132525143 @default.
• W974563791 hasConceptScore W974563791C147517495 @default.
• W974563791 hasConceptScore W974563791C148764684 @default.
• W974563791 hasConceptScore W974563791C149635348 @default.
• W974563791 hasConceptScore W974563791C163797641 @default.
• W974563791 hasConceptScore W974563791C197855036 @default.
• W974563791 hasConceptScore W974563791C202750272 @default.
• W974563791 hasConceptScore W974563791C2780513914 @default.
• W974563791 hasConceptScore W974563791C311688 @default.
• W974563791 hasConceptScore W974563791C33923547 @default.
• W974563791 hasConceptScore W974563791C41008148 @default.
• W974563791 hasConceptScore W974563791C76220878 @default.
• W974563791 hasConceptScore W974563791C80899671 @default.
• W974563791 hasFunder F4320334593 @default.
• W974563791 hasLocation W9745637911 @default.
• W974563791 hasOpenAccess W974563791 @default.
• W974563791 hasPrimaryLocation W9745637911 @default.
• W974563791 hasRelatedWork W1982174735 @default.
• W974563791 hasRelatedWork W1992362850 @default.
• W974563791 hasRelatedWork W1992573093 @default.
• W974563791 hasRelatedWork W2086305925 @default.
• W974563791 hasRelatedWork W2112379399 @default.
• W974563791 hasRelatedWork W2545708558 @default.
• W974563791 hasRelatedWork W2897253417 @default.
• W974563791 hasRelatedWork W2945240418 @default.
• W974563791 hasRelatedWork W2949165555 @default.
• W974563791 hasRelatedWork W3088222391 @default.
• W974563791 hasVolume "34" @default.
• W974563791 isParatext "false" @default.
• W974563791 isRetracted "false" @default.
• W974563791 magId "974563791" @default.
• W974563791 workType "article" @default.