Matches in SemOpenAlex for { <https://semopenalex.org/work/W2891873695> ?p ?o ?g. }
- W2891873695 endingPage "1431" @default.
- W2891873695 startingPage "1413" @default.
- W2891873695 abstract "We present polynomial-time approximation algorithms for some degree-bounded directed network design problems. Our main result is for intersecting supermodular connectivity requirements with degree bounds: given a directed graph $G=(V,E)$ with nonnegative edge-costs, a connectivity requirement specified by an intersecting supermodular function f, and upper bounds ${a_v,b_v}_{vin V}$ on in-degrees and out-degrees of vertices, find a minimum-cost f-connected subgraph of G that satisfies the degree bounds. We give a bicriteria approximation algorithm for this problem using the natural LP relaxation and show that our guarantee is the best possible relative to this LP relaxation. We also obtain similar results for the (more general) class of crossing supermodular requirements. In the absence of edge-costs, our result gives the first additive $O(1)$-approximation guarantee for degree-bounded intersecting/crossing supermodular connectivity problems. We also consider the minimum crossing spanning tree problem: Given an undirected edge-weighted graph G, edge-subsets ${E_i}_{i=1}^k$, and nonnegative integers ${b_i}_{i=1}^k$, find a minimum-cost spanning tree (if it exists) in G that contains at most $b_i$ edges from each set $E_i$. We obtain a $+(r-1)$ additive approximation for this problem, when each edge lies in at most r sets. A special case of this problem is the degree-bounded minimum spanning tree, and our techniques give a substantially shorter proof of the recent $+1$ approximation of Singh and Lau [in Proceedings of the 40th Annual ACM Symposium on Theory of Computing, 2007, pp. 661–670]." @default.
- W2891873695 created "2018-09-27" @default.
- W2891873695 creator A5008689083 @default.
- W2891873695 creator A5051270969 @default.
- W2891873695 creator A5074837451 @default.
- W2891873695 date "2010-01-01" @default.
- W2891873695 modified "2023-10-18" @default.
- W2891873695 title "Additive Guarantees for Degree-Bounded Directed Network Design" @default.
- W2891873695 cites W1971422464 @default.
- W2891873695 cites W1972453585 @default.
- W2891873695 cites W1998141189 @default.
- W2891873695 cites W2012586162 @default.
- W2891873695 cites W2054232722 @default.
- W2891873695 cites W2063807274 @default.
- W2891873695 cites W2066700938 @default.
- W2891873695 cites W2172955861 @default.
- W2891873695 cites W2604625050 @default.
- W2891873695 cites W4234130962 @default.
- W2891873695 cites W2110257828 @default.
- W2891873695 doi "https://doi.org/10.1137/080734340" @default.
- W2891873695 hasPublicationYear "2010" @default.
- W2891873695 type Work @default.
- W2891873695 sameAs 2891873695 @default.
- W2891873695 citedByCount "49" @default.
- W2891873695 countsByYear W28918736952012 @default.
- W2891873695 countsByYear W28918736952013 @default.
- W2891873695 countsByYear W28918736952014 @default.
- W2891873695 countsByYear W28918736952015 @default.
- W2891873695 countsByYear W28918736952016 @default.
- W2891873695 countsByYear W28918736952017 @default.
- W2891873695 countsByYear W28918736952019 @default.
- W2891873695 countsByYear W28918736952020 @default.
- W2891873695 countsByYear W28918736952021 @default.
- W2891873695 countsByYear W28918736952023 @default.
- W2891873695 crossrefType "journal-article" @default.
- W2891873695 hasAuthorship W2891873695A5008689083 @default.
- W2891873695 hasAuthorship W2891873695A5051270969 @default.
- W2891873695 hasAuthorship W2891873695A5074837451 @default.
- W2891873695 hasBestOaLocation W28918736952 @default.
- W2891873695 hasConcept C114614502 @default.
- W2891873695 hasConcept C118615104 @default.
- W2891873695 hasConcept C121332964 @default.
- W2891873695 hasConcept C126255220 @default.
- W2891873695 hasConcept C132525143 @default.
- W2891873695 hasConcept C134306372 @default.
- W2891873695 hasConcept C13743678 @default.
- W2891873695 hasConcept C148764684 @default.
- W2891873695 hasConcept C15744967 @default.
- W2891873695 hasConcept C24890656 @default.
- W2891873695 hasConcept C25360446 @default.
- W2891873695 hasConcept C2775997480 @default.
- W2891873695 hasConcept C2776029896 @default.
- W2891873695 hasConcept C33923547 @default.
- W2891873695 hasConcept C34388435 @default.
- W2891873695 hasConcept C41045048 @default.
- W2891873695 hasConcept C64331007 @default.
- W2891873695 hasConcept C76220878 @default.
- W2891873695 hasConcept C77553402 @default.
- W2891873695 hasConcept C77805123 @default.
- W2891873695 hasConceptScore W2891873695C114614502 @default.
- W2891873695 hasConceptScore W2891873695C118615104 @default.
- W2891873695 hasConceptScore W2891873695C121332964 @default.
- W2891873695 hasConceptScore W2891873695C126255220 @default.
- W2891873695 hasConceptScore W2891873695C132525143 @default.
- W2891873695 hasConceptScore W2891873695C134306372 @default.
- W2891873695 hasConceptScore W2891873695C13743678 @default.
- W2891873695 hasConceptScore W2891873695C148764684 @default.
- W2891873695 hasConceptScore W2891873695C15744967 @default.
- W2891873695 hasConceptScore W2891873695C24890656 @default.
- W2891873695 hasConceptScore W2891873695C25360446 @default.
- W2891873695 hasConceptScore W2891873695C2775997480 @default.
- W2891873695 hasConceptScore W2891873695C2776029896 @default.
- W2891873695 hasConceptScore W2891873695C33923547 @default.
- W2891873695 hasConceptScore W2891873695C34388435 @default.
- W2891873695 hasConceptScore W2891873695C41045048 @default.
- W2891873695 hasConceptScore W2891873695C64331007 @default.
- W2891873695 hasConceptScore W2891873695C76220878 @default.
- W2891873695 hasConceptScore W2891873695C77553402 @default.
- W2891873695 hasConceptScore W2891873695C77805123 @default.
- W2891873695 hasIssue "4" @default.
- W2891873695 hasLocation W28918736951 @default.
- W2891873695 hasLocation W28918736952 @default.
- W2891873695 hasLocation W28918736953 @default.
- W2891873695 hasOpenAccess W2891873695 @default.
- W2891873695 hasPrimaryLocation W28918736951 @default.
- W2891873695 hasRelatedWork W1505339140 @default.
- W2891873695 hasRelatedWork W1991055327 @default.
- W2891873695 hasRelatedWork W1992520347 @default.
- W2891873695 hasRelatedWork W2004761333 @default.
- W2891873695 hasRelatedWork W2074881724 @default.
- W2891873695 hasRelatedWork W2137653883 @default.
- W2891873695 hasRelatedWork W2157421865 @default.
- W2891873695 hasRelatedWork W2754301405 @default.
- W2891873695 hasRelatedWork W2788398742 @default.
- W2891873695 hasRelatedWork W1868361628 @default.
- W2891873695 hasVolume "39" @default.
- W2891873695 isParatext "false" @default.
- W2891873695 isRetracted "false" @default.