Matches in SemOpenAlex for { <https://semopenalex.org/work/W4297665417> ?p ?o ?g. }
Showing items 1 to 54 of
54
with 100 items per page.
- W4297665417 abstract "In the vertex connectivity survivable network design problem we are given an undirected graph G = (V,E) and connectivity requirement r(u,v) for each pair of vertices u,v. We are also given a cost function on the set of edges. Our goal is to find the minimum cost subset of edges such that for every pair (u,v) of vertices we have r(u,v) vertex disjoint paths in the graph induced by the chosen edges. Recently, Chuzhoy and Khanna presented a randomized algorithm that achieves a factor of O(k^3 log n) for this problem where k is the maximum connectivity requirement. In this paper we derandomize their algorithm to get a deterministic O(k^3 log n) factor algorithm. Another problem of interest is the single source version of the problem, where there is a special vertex s and all non-zero connectivity requirements must involve s. We also give a deterministic O(k^2 log n) algorithm for this problem." @default.
- W4297665417 created "2022-09-30" @default.
- W4297665417 creator A5040307243 @default.
- W4297665417 date "2010-04-07" @default.
- W4297665417 modified "2023-09-26" @default.
- W4297665417 title "A Deterministic Algorithm for the Vertex Connectivity Survivable Network Design Problem" @default.
- W4297665417 doi "https://doi.org/10.48550/arxiv.1004.1208" @default.
- W4297665417 hasPublicationYear "2010" @default.
- W4297665417 type Work @default.
- W4297665417 citedByCount "0" @default.
- W4297665417 crossrefType "posted-content" @default.
- W4297665417 hasAuthorship W4297665417A5040307243 @default.
- W4297665417 hasBestOaLocation W42976654171 @default.
- W4297665417 hasConcept C11413529 @default.
- W4297665417 hasConcept C114614502 @default.
- W4297665417 hasConcept C118615104 @default.
- W4297665417 hasConcept C132525143 @default.
- W4297665417 hasConcept C134306372 @default.
- W4297665417 hasConcept C161677786 @default.
- W4297665417 hasConcept C3018234147 @default.
- W4297665417 hasConcept C33923547 @default.
- W4297665417 hasConcept C41008148 @default.
- W4297665417 hasConcept C45340560 @default.
- W4297665417 hasConcept C63553672 @default.
- W4297665417 hasConcept C80899671 @default.
- W4297665417 hasConceptScore W4297665417C11413529 @default.
- W4297665417 hasConceptScore W4297665417C114614502 @default.
- W4297665417 hasConceptScore W4297665417C118615104 @default.
- W4297665417 hasConceptScore W4297665417C132525143 @default.
- W4297665417 hasConceptScore W4297665417C134306372 @default.
- W4297665417 hasConceptScore W4297665417C161677786 @default.
- W4297665417 hasConceptScore W4297665417C3018234147 @default.
- W4297665417 hasConceptScore W4297665417C33923547 @default.
- W4297665417 hasConceptScore W4297665417C41008148 @default.
- W4297665417 hasConceptScore W4297665417C45340560 @default.
- W4297665417 hasConceptScore W4297665417C63553672 @default.
- W4297665417 hasConceptScore W4297665417C80899671 @default.
- W4297665417 hasLocation W42976654171 @default.
- W4297665417 hasLocation W42976654172 @default.
- W4297665417 hasOpenAccess W4297665417 @default.
- W4297665417 hasPrimaryLocation W42976654171 @default.
- W4297665417 hasRelatedWork W1541319718 @default.
- W4297665417 hasRelatedWork W1559700736 @default.
- W4297665417 hasRelatedWork W1575996043 @default.
- W4297665417 hasRelatedWork W1979357680 @default.
- W4297665417 hasRelatedWork W2037065294 @default.
- W4297665417 hasRelatedWork W2136672189 @default.
- W4297665417 hasRelatedWork W2588867027 @default.
- W4297665417 hasRelatedWork W2888987890 @default.
- W4297665417 hasRelatedWork W2982004541 @default.
- W4297665417 hasRelatedWork W4297538187 @default.
- W4297665417 isParatext "false" @default.
- W4297665417 isRetracted "false" @default.
- W4297665417 workType "article" @default.