Please use this identifier to cite or link to this item:
https://hdl.handle.net/2440/80009
Citations | ||
Scopus | Web of Science® | Altmetric |
---|---|---|
?
|
?
|
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Shen, H. | - |
dc.contributor.author | Guo, L. | - |
dc.date.issued | 2013 | - |
dc.identifier.citation | IEEE Transactions on Computers, 2013; 62(9):1684-1693 | - |
dc.identifier.issn | 0018-9340 | - |
dc.identifier.issn | 1557-9956 | - |
dc.identifier.uri | http://hdl.handle.net/2440/80009 | - |
dc.description.abstract | For a given undirected (edge) weighted graph G = (V, E), a terminal set S ⊆ V and a root r ∈ S, the rooted k-vertex connected minimum Steiner network (kVSMNr) problem requires to construct a minimum-cost subgraph of G such that each terminal in S {R} is k-vertex connected to τ. As an important problem in survivable network design, the kVSMNτ problem is known to be NP-hard even when k 1/4 1 [14]. For k 1/4 3 this paper presents a simple combinatorial eight-approximation algorithm, improving the known best ratio 14 of Nutov [20]. Our algorithm constructs an approximate 3VSMNτ through augmenting a two-vertex connected counterpart with additional edges of bounded cost to the optimal. We prove that the total cost of the added edges is at most six times of the optimal by showing that the edges in a 3VSMNτ compose a subgraph containing our solution in such a way that each edge appears in the subgraph at most six times. | - |
dc.description.statementofresponsibility | Hong Shen, Longkun Guo | - |
dc.language.iso | en | - |
dc.publisher | IEEE Computer Soc | - |
dc.rights | Copyright status unknown | - |
dc.source.uri | http://dx.doi.org/10.1109/tc.2012.170 | - |
dc.title | An eight-approximation algorithm for computing rooted three-vertex connected minimum steiner networks | - |
dc.type | Journal article | - |
dc.identifier.doi | 10.1109/TC.2012.170 | - |
pubs.publication-status | Published | - |
dc.identifier.orcid | Shen, H. [0000-0002-3663-6591] [0000-0003-0649-0648] | - |
Appears in Collections: | Aurora harvest 4 Computer Science publications |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
RA_hdl_80009.pdf Restricted Access | Restricted Access | 383.13 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.