Matches in SemOpenAlex for { <https://semopenalex.org/work/W2117054620> ?p ?o ?g. }
Showing items 1 to 63 of
63
with 100 items per page.
- W2117054620 abstract "We present a greedy algorithm for the directed Steiner tree problem (DST), where any tree rooted at any (uncovered) terminal can be a candidate for greedy choice. It will be shown that the algorithm, running in polynomial time for any constant l, outputs a directed Steiner tree of cost no larger than 2(l−1)(ln n+1) times the cost of the minimum l-restricted Steiner tree. We derive from this result that 1) DST for a class of graphs, including quasi-bipartite graphs, in which the length of paths induced by Steiner vertices is bounded by some constant can be approximated within a factor of O(logn), and 2) the tree cover problem on directed graphs can also be approximated within a factor of O(logn)." @default.
- W2117054620 created "2016-06-24" @default.
- W2117054620 creator A5006109156 @default.
- W2117054620 creator A5014209426 @default.
- W2117054620 date "2012-01-01" @default.
- W2117054620 modified "2023-10-05" @default.
- W2117054620 title "Multi-rooted Greedy Approximation of Directed Steiner Trees with Applications" @default.
- W2117054620 cites W109985799 @default.
- W2117054620 cites W1511839580 @default.
- W2117054620 cites W1975361422 @default.
- W2117054620 cites W1977712294 @default.
- W2117054620 cites W1991055327 @default.
- W2117054620 cites W2003159902 @default.
- W2117054620 cites W2005771129 @default.
- W2117054620 cites W2009976792 @default.
- W2117054620 cites W2012130001 @default.
- W2117054620 cites W2027515293 @default.
- W2117054620 cites W2039298646 @default.
- W2117054620 cites W2065161629 @default.
- W2117054620 cites W2114791943 @default.
- W2117054620 cites W2143996311 @default.
- W2117054620 cites W2295961103 @default.
- W2117054620 cites W2401610261 @default.
- W2117054620 cites W3122807693 @default.
- W2117054620 doi "https://doi.org/10.1007/978-3-642-34611-8_23" @default.
- W2117054620 hasPublicationYear "2012" @default.
- W2117054620 type Work @default.
- W2117054620 sameAs 2117054620 @default.
- W2117054620 citedByCount "0" @default.
- W2117054620 crossrefType "book-chapter" @default.
- W2117054620 hasAuthorship W2117054620A5006109156 @default.
- W2117054620 hasAuthorship W2117054620A5014209426 @default.
- W2117054620 hasConcept C11413529 @default.
- W2117054620 hasConcept C114614502 @default.
- W2117054620 hasConcept C126255220 @default.
- W2117054620 hasConcept C33923547 @default.
- W2117054620 hasConcept C41008148 @default.
- W2117054620 hasConcept C51823790 @default.
- W2117054620 hasConcept C76220878 @default.
- W2117054620 hasConceptScore W2117054620C11413529 @default.
- W2117054620 hasConceptScore W2117054620C114614502 @default.
- W2117054620 hasConceptScore W2117054620C126255220 @default.
- W2117054620 hasConceptScore W2117054620C33923547 @default.
- W2117054620 hasConceptScore W2117054620C41008148 @default.
- W2117054620 hasConceptScore W2117054620C51823790 @default.
- W2117054620 hasConceptScore W2117054620C76220878 @default.
- W2117054620 hasLocation W21170546201 @default.
- W2117054620 hasOpenAccess W2117054620 @default.
- W2117054620 hasPrimaryLocation W21170546201 @default.
- W2117054620 hasRelatedWork W1609307790 @default.
- W2117054620 hasRelatedWork W1977119994 @default.
- W2117054620 hasRelatedWork W1991925252 @default.
- W2117054620 hasRelatedWork W2086305925 @default.
- W2117054620 hasRelatedWork W2090486508 @default.
- W2117054620 hasRelatedWork W2125311247 @default.
- W2117054620 hasRelatedWork W2407277019 @default.
- W2117054620 hasRelatedWork W3035891971 @default.
- W2117054620 hasRelatedWork W3094179009 @default.
- W2117054620 hasRelatedWork W3187836939 @default.
- W2117054620 isParatext "false" @default.
- W2117054620 isRetracted "false" @default.
- W2117054620 magId "2117054620" @default.
- W2117054620 workType "book-chapter" @default.