Matches in SemOpenAlex for { <https://semopenalex.org/work/W1497398712> ?p ?o ?g. }
Showing items 1 to 89 of
89
with 100 items per page.
- W1497398712 endingPage "285" @default.
- W1497398712 startingPage "278" @default.
- W1497398712 abstract "Given a graph G= (V,E) with node weight w: V?R+and a subset S? V, find a minimum total weight tree interconnecting all nodes in S. This is the node-weighted Steiner tree problem which will be studied in this paper. In general, this problem is NP-hard and cannot be approximated by a polynomial time algorithm with performance ratio aln nfor any 0 < a< 1 unless NP? DTIME(nO(logn)), where nis the number of nodes in s. In this paper, we show that for unit disk graph, the problem is still NP-hard, however it has polynomial time constant approximation. We will present a 4-approximation and a 2.5ρ-approximation where ρis the best known performance ratio for polynomial time approximation of classical Steiner minimum tree problem in graphs. As a corollary, we obtain that there is polynomial time (9.875+?)-approximation algorithm for minimum weight connected dominating set in unit disk graphs." @default.
- W1497398712 created "2016-06-24" @default.
- W1497398712 creator A5029410135 @default.
- W1497398712 creator A5053722882 @default.
- W1497398712 creator A5070037321 @default.
- W1497398712 creator A5085660248 @default.
- W1497398712 date "2008-08-19" @default.
- W1497398712 modified "2023-09-25" @default.
- W1497398712 title "Two Constant Approximation Algorithms for Node-Weighted Steiner Tree in Unit Disk Graphs" @default.
- W1497398712 cites W1963899113 @default.
- W1497398712 cites W1974888782 @default.
- W1497398712 cites W1975290397 @default.
- W1497398712 cites W1983607113 @default.
- W1497398712 cites W2003882909 @default.
- W1497398712 cites W2007503572 @default.
- W1497398712 cites W2008771115 @default.
- W1497398712 cites W2012130001 @default.
- W1497398712 cites W2024884029 @default.
- W1497398712 cites W2047723482 @default.
- W1497398712 cites W2115616619 @default.
- W1497398712 cites W2140951480 @default.
- W1497398712 cites W2143996311 @default.
- W1497398712 doi "https://doi.org/10.1007/978-3-540-85097-7_26" @default.
- W1497398712 hasPublicationYear "2008" @default.
- W1497398712 type Work @default.
- W1497398712 sameAs 1497398712 @default.
- W1497398712 citedByCount "12" @default.
- W1497398712 countsByYear W14973987122012 @default.
- W1497398712 countsByYear W14973987122013 @default.
- W1497398712 countsByYear W14973987122016 @default.
- W1497398712 countsByYear W14973987122017 @default.
- W1497398712 countsByYear W14973987122019 @default.
- W1497398712 countsByYear W14973987122022 @default.
- W1497398712 crossrefType "book-chapter" @default.
- W1497398712 hasAuthorship W1497398712A5029410135 @default.
- W1497398712 hasAuthorship W1497398712A5053722882 @default.
- W1497398712 hasAuthorship W1497398712A5070037321 @default.
- W1497398712 hasAuthorship W1497398712A5085660248 @default.
- W1497398712 hasConcept C113174947 @default.
- W1497398712 hasConcept C11413529 @default.
- W1497398712 hasConcept C114614502 @default.
- W1497398712 hasConcept C118615104 @default.
- W1497398712 hasConcept C121332964 @default.
- W1497398712 hasConcept C122637931 @default.
- W1497398712 hasConcept C145420912 @default.
- W1497398712 hasConcept C148764684 @default.
- W1497398712 hasConcept C199360897 @default.
- W1497398712 hasConcept C2777027219 @default.
- W1497398712 hasConcept C33923547 @default.
- W1497398712 hasConcept C41008148 @default.
- W1497398712 hasConcept C47177299 @default.
- W1497398712 hasConcept C62520636 @default.
- W1497398712 hasConcept C62611344 @default.
- W1497398712 hasConcept C76220878 @default.
- W1497398712 hasConceptScore W1497398712C113174947 @default.
- W1497398712 hasConceptScore W1497398712C11413529 @default.
- W1497398712 hasConceptScore W1497398712C114614502 @default.
- W1497398712 hasConceptScore W1497398712C118615104 @default.
- W1497398712 hasConceptScore W1497398712C121332964 @default.
- W1497398712 hasConceptScore W1497398712C122637931 @default.
- W1497398712 hasConceptScore W1497398712C145420912 @default.
- W1497398712 hasConceptScore W1497398712C148764684 @default.
- W1497398712 hasConceptScore W1497398712C199360897 @default.
- W1497398712 hasConceptScore W1497398712C2777027219 @default.
- W1497398712 hasConceptScore W1497398712C33923547 @default.
- W1497398712 hasConceptScore W1497398712C41008148 @default.
- W1497398712 hasConceptScore W1497398712C47177299 @default.
- W1497398712 hasConceptScore W1497398712C62520636 @default.
- W1497398712 hasConceptScore W1497398712C62611344 @default.
- W1497398712 hasConceptScore W1497398712C76220878 @default.
- W1497398712 hasLocation W14973987121 @default.
- W1497398712 hasOpenAccess W1497398712 @default.
- W1497398712 hasPrimaryLocation W14973987121 @default.
- W1497398712 hasRelatedWork W2056824842 @default.
- W1497398712 hasRelatedWork W2090953203 @default.
- W1497398712 hasRelatedWork W2096769178 @default.
- W1497398712 hasRelatedWork W2154295079 @default.
- W1497398712 hasRelatedWork W2162128519 @default.
- W1497398712 hasRelatedWork W2407277019 @default.
- W1497398712 hasRelatedWork W3023282321 @default.
- W1497398712 hasRelatedWork W3094179009 @default.
- W1497398712 hasRelatedWork W3194189065 @default.
- W1497398712 hasRelatedWork W328736688 @default.
- W1497398712 isParatext "false" @default.
- W1497398712 isRetracted "false" @default.
- W1497398712 magId "1497398712" @default.
- W1497398712 workType "book-chapter" @default.