FRINK Linked Data Fragments server

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

• W2155177580 endingPage "980" @default.
• W2155177580 startingPage "953" @default.
• W2155177580 abstract "Given a complete undirected graph, a cost function on edges, and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum degree B satisfying given connectivity requirements. Even for a simple connectivity requirement such as finding a spanning tree, computing a feasible solution for the degree bounded network design problem is already NP-hard, and thus there is no polynomial factor approximation algorithm for this problem. In this paper, we show that when the cost function satisfies the triangle inequality, there are constant factor approximation algorithms for various degree bounded network design problems. In global edge-connectivity, there is a $(2+frac{1}{k})$-approximation algorithm for the minimum bounded degree k-edge-connected subgraph problem. In local edge-connectivity, there is a 4-approximation algorithm for the minimum bounded degree Steiner network problem when $r_{max}$ is even, and a 5.5-approximation algorithm when $r_{max}$ is odd, where $r_{max}$ is the maximum connectivity requirement. In global vertex-connectivity, there is a $(2+frac{k-1}{n}+frac{1}{k})$-approximation algorithm for the minimum bounded degree k-vertex-connected subgraph problem when $ngeq2k$, where n is the number of vertices. For spanning tree, there is a $(1+frac{1}{B-1})$-approximation algorithm for the minimum bounded degree spanning tree problem. These approximation algorithms return solutions with the smallest possible maximum degree, and in most cases the cost guarantee is obtained by comparing to the optimal cost when there are no degree constraints. This demonstrates that degree constraints can be incorporated into network design problems with metric costs. Our algorithms can be seen as a generalization of Christofides' algorithm for the metric traveling salesman problem. The main technical tool is a simplicity-preserving edge splitting-off operation, which is used to “short-cut” vertices with high degree while maintaining connectivity requirements and preserving simplicity of the solutions." @default.
• W2155177580 created "2016-06-24" @default.
• W2155177580 creator A5001781067 @default.
• W2155177580 creator A5002911877 @default.
• W2155177580 creator A5008440961 @default.
• W2155177580 creator A5022887225 @default.
• W2155177580 date "2011-01-01" @default.
• W2155177580 modified "2023-09-29" @default.
• W2155177580 title "Degree Bounded Network Design with Metric Costs" @default.
• W2155177580 cites W1786780942 @default.
• W2155177580 cites W1980942794 @default.
• W2155177580 cites W1981743701 @default.
• W2155177580 cites W2002985966 @default.
• W2155177580 cites W2006060626 @default.
• W2155177580 cites W2010478727 @default.
• W2155177580 cites W2016764804 @default.
• W2155177580 cites W2017501272 @default.
• W2155177580 cites W2027868217 @default.
• W2155177580 cites W2028957123 @default.
• W2155177580 cites W2037328176 @default.
• W2155177580 cites W2042489938 @default.
• W2155177580 cites W2048815229 @default.
• W2155177580 cites W2062530569 @default.
• W2155177580 cites W2072970094 @default.
• W2155177580 cites W2079430060 @default.
• W2155177580 cites W2088839217 @default.
• W2155177580 cites W2092113566 @default.
• W2155177580 cites W2097945626 @default.
• W2155177580 cites W2116680937 @default.
• W2155177580 cites W2135211390 @default.
• W2155177580 cites W2159586130 @default.
• W2155177580 cites W2172955861 @default.
• W2155177580 cites W2178484001 @default.
• W2155177580 cites W2602800732 @default.
• W2155177580 cites W3099328339 @default.
• W2155177580 cites W4367329880 @default.
• W2155177580 doi "https://doi.org/10.1137/090746495" @default.
• W2155177580 hasPublicationYear "2011" @default.
• W2155177580 type Work @default.
• W2155177580 sameAs 2155177580 @default.
• W2155177580 citedByCount "9" @default.
• W2155177580 countsByYear W21551775802012 @default.
• W2155177580 countsByYear W21551775802013 @default.
• W2155177580 countsByYear W21551775802014 @default.
• W2155177580 countsByYear W21551775802015 @default.
• W2155177580 countsByYear W21551775802016 @default.
• W2155177580 countsByYear W21551775802017 @default.
• W2155177580 countsByYear W21551775802023 @default.
• W2155177580 crossrefType "journal-article" @default.
• W2155177580 hasAuthorship W2155177580A5001781067 @default.
• W2155177580 hasAuthorship W2155177580A5002911877 @default.
• W2155177580 hasAuthorship W2155177580A5008440961 @default.
• W2155177580 hasAuthorship W2155177580A5022887225 @default.
• W2155177580 hasBestOaLocation W21551775802 @default.
• W2155177580 hasConcept C114614502 @default.
• W2155177580 hasConcept C118615104 @default.
• W2155177580 hasConcept C121332964 @default.
• W2155177580 hasConcept C132525143 @default.
• W2155177580 hasConcept C134306372 @default.
• W2155177580 hasConcept C13743678 @default.
• W2155177580 hasConcept C148764684 @default.
• W2155177580 hasConcept C24890656 @default.
• W2155177580 hasConcept C2775997480 @default.
• W2155177580 hasConcept C33923547 @default.
• W2155177580 hasConcept C34388435 @default.
• W2155177580 hasConcept C64331007 @default.
• W2155177580 hasConcept C76220878 @default.
• W2155177580 hasConcept C80899671 @default.
• W2155177580 hasConceptScore W2155177580C114614502 @default.
• W2155177580 hasConceptScore W2155177580C118615104 @default.
• W2155177580 hasConceptScore W2155177580C121332964 @default.
• W2155177580 hasConceptScore W2155177580C132525143 @default.
• W2155177580 hasConceptScore W2155177580C134306372 @default.
• W2155177580 hasConceptScore W2155177580C13743678 @default.
• W2155177580 hasConceptScore W2155177580C148764684 @default.
• W2155177580 hasConceptScore W2155177580C24890656 @default.
• W2155177580 hasConceptScore W2155177580C2775997480 @default.
• W2155177580 hasConceptScore W2155177580C33923547 @default.
• W2155177580 hasConceptScore W2155177580C34388435 @default.
• W2155177580 hasConceptScore W2155177580C64331007 @default.
• W2155177580 hasConceptScore W2155177580C76220878 @default.
• W2155177580 hasConceptScore W2155177580C80899671 @default.
• W2155177580 hasIssue "4" @default.
• W2155177580 hasLocation W21551775801 @default.
• W2155177580 hasLocation W21551775802 @default.
• W2155177580 hasOpenAccess W2155177580 @default.
• W2155177580 hasPrimaryLocation W21551775801 @default.
• W2155177580 hasRelatedWork W2030879379 @default.
• W2155177580 hasRelatedWork W2074881724 @default.
• W2155177580 hasRelatedWork W2125607890 @default.
• W2155177580 hasRelatedWork W2157421865 @default.
• W2155177580 hasRelatedWork W2294107416 @default.
• W2155177580 hasRelatedWork W2788398742 @default.
• W2155177580 hasRelatedWork W3047993683 @default.
• W2155177580 hasRelatedWork W3194189065 @default.
• W2155177580 hasRelatedWork W4385970294 @default.
• W2155177580 hasRelatedWork W1868361628 @default.
• W2155177580 hasVolume "40" @default.

• next