FRINK Linked Data Fragments server

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

• W2052113818 endingPage "736" @default.
• W2052113818 startingPage "725" @default.
• W2052113818 abstract "We study several network design problems with degree constraints. For the minimum-cost Degree-Constrained 2 -Node-Connected Subgraph problem, we obtain the first non-trivial bicriteria approximation algorithm, with 5 b ( v ) + 3 violation for the degrees and a 4-approximation for the cost. This improves upon the logarithmic degree violation and no cost guarantee obtained by Feder, Motwani, and Zhu (2006). Then we consider the problem of finding an arborescence with at least k terminals and with minimum maximum outdegree. We show that the natural LP-relaxation has a gap of Ω ( k ) or Ω ( n 1 / 4 ) with respect to the multiplicative degree bound violation. We overcome this hurdle by a combinatorial O ( ( k log k ) / Δ ⁎ ) -approximation algorithm, where Δ ⁎ denotes the maximum degree in the optimum solution. We also give an Ω ( log n ) lower bound on approximating this problem. Then we consider the undirected version of this problem, however, with an extra diameter constraint, and give an Ω ( log n ) lower bound on the approximability of this version. We also consider a closely related Prize-Collecting Degree-Constrained Edge-Connectivity Survivable Network problem, and obtain several results in this direction by reducing the prize-collecting variant to the regular one. Finally, we consider the Terminal Steiner Tree problem, which is a simple variant of the Degree-Constrained Steiner Tree problem, when some terminals are required to be leaves. We show that this seemingly simple problem is equivalent to the Group Steiner Tree problem. ► For the problem of finding a 2-connected subgraph with degree bounds we give a bicriteria constant approximation. ► We give an O ˜ ( k / opt ) approximation for finding a directed k -tree with minimum outdegree. ► We give a constant ratio for the prize collecting version of the second problem. ► For Steiner forest with hard degree bounds of 1, we give an O ( log 3 n ) ratio." @default.
• W2052113818 created "2016-06-24" @default.
• W2052113818 creator A5003622145 @default.
• W2052113818 creator A5056370891 @default.
• W2052113818 creator A5074837451 @default.
• W2052113818 date "2013-08-01" @default.
• W2052113818 modified "2023-09-26" @default.
• W2052113818 title "On some network design problems with degree constraints" @default.
• W2052113818 cites W1522859394 @default.
• W2052113818 cites W1590881797 @default.
• W2052113818 cites W1595291551 @default.
• W2052113818 cites W1614197999 @default.
• W2052113818 cites W195354029 @default.
• W2052113818 cites W1971422464 @default.
• W2052113818 cites W1980288485 @default.
• W2052113818 cites W1992573093 @default.
• W2052113818 cites W2008802014 @default.
• W2052113818 cites W2009976792 @default.
• W2052113818 cites W2029828838 @default.
• W2052113818 cites W2034112563 @default.
• W2052113818 cites W2053342610 @default.
• W2052113818 cites W2055505431 @default.
• W2052113818 cites W2066700938 @default.
• W2052113818 cites W2087937221 @default.
• W2052113818 cites W2129939288 @default.
• W2052113818 cites W2157421865 @default.
• W2052113818 cites W2161190897 @default.
• W2052113818 cites W2167294598 @default.
• W2052113818 cites W2172955861 @default.
• W2052113818 cites W2295961103 @default.
• W2052113818 cites W2610052675 @default.
• W2052113818 cites W2891873695 @default.
• W2052113818 cites W3122273056 @default.
• W2052113818 doi "https://doi.org/10.1016/j.jcss.2013.01.019" @default.
• W2052113818 hasPublicationYear "2013" @default.
• W2052113818 type Work @default.
• W2052113818 sameAs 2052113818 @default.
• W2052113818 citedByCount "22" @default.
• W2052113818 countsByYear W20521138182013 @default.
• W2052113818 countsByYear W20521138182014 @default.
• W2052113818 countsByYear W20521138182015 @default.
• W2052113818 countsByYear W20521138182016 @default.
• W2052113818 countsByYear W20521138182017 @default.
• W2052113818 countsByYear W20521138182019 @default.
• W2052113818 countsByYear W20521138182020 @default.
• W2052113818 countsByYear W20521138182021 @default.
• W2052113818 crossrefType "journal-article" @default.
• W2052113818 hasAuthorship W2052113818A5003622145 @default.
• W2052113818 hasAuthorship W2052113818A5056370891 @default.
• W2052113818 hasAuthorship W2052113818A5074837451 @default.
• W2052113818 hasBestOaLocation W20521138182 @default.
• W2052113818 hasConcept C111472728 @default.
• W2052113818 hasConcept C113174947 @default.
• W2052113818 hasConcept C114614502 @default.
• W2052113818 hasConcept C118615104 @default.
• W2052113818 hasConcept C121332964 @default.
• W2052113818 hasConcept C126255220 @default.
• W2052113818 hasConcept C134306372 @default.
• W2052113818 hasConcept C138885662 @default.
• W2052113818 hasConcept C148764684 @default.
• W2052113818 hasConcept C24890656 @default.
• W2052113818 hasConcept C2524010 @default.
• W2052113818 hasConcept C25360446 @default.
• W2052113818 hasConcept C2775997480 @default.
• W2052113818 hasConcept C2776036281 @default.
• W2052113818 hasConcept C2780586882 @default.
• W2052113818 hasConcept C33923547 @default.
• W2052113818 hasConcept C39927690 @default.
• W2052113818 hasConcept C41045048 @default.
• W2052113818 hasConcept C42747912 @default.
• W2052113818 hasConcept C76220878 @default.
• W2052113818 hasConcept C77553402 @default.
• W2052113818 hasConceptScore W2052113818C111472728 @default.
• W2052113818 hasConceptScore W2052113818C113174947 @default.
• W2052113818 hasConceptScore W2052113818C114614502 @default.
• W2052113818 hasConceptScore W2052113818C118615104 @default.
• W2052113818 hasConceptScore W2052113818C121332964 @default.
• W2052113818 hasConceptScore W2052113818C126255220 @default.
• W2052113818 hasConceptScore W2052113818C134306372 @default.
• W2052113818 hasConceptScore W2052113818C138885662 @default.
• W2052113818 hasConceptScore W2052113818C148764684 @default.
• W2052113818 hasConceptScore W2052113818C24890656 @default.
• W2052113818 hasConceptScore W2052113818C2524010 @default.
• W2052113818 hasConceptScore W2052113818C25360446 @default.
• W2052113818 hasConceptScore W2052113818C2775997480 @default.
• W2052113818 hasConceptScore W2052113818C2776036281 @default.
• W2052113818 hasConceptScore W2052113818C2780586882 @default.
• W2052113818 hasConceptScore W2052113818C33923547 @default.
• W2052113818 hasConceptScore W2052113818C39927690 @default.
• W2052113818 hasConceptScore W2052113818C41045048 @default.
• W2052113818 hasConceptScore W2052113818C42747912 @default.
• W2052113818 hasConceptScore W2052113818C76220878 @default.
• W2052113818 hasConceptScore W2052113818C77553402 @default.
• W2052113818 hasIssue "5" @default.
• W2052113818 hasLocation W20521138181 @default.
• W2052113818 hasLocation W20521138182 @default.
• W2052113818 hasOpenAccess W2052113818 @default.
• W2052113818 hasPrimaryLocation W20521138181 @default.

• next