Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
From MaRDI portal
Publication:3595414
DOI10.1007/11830924_23zbMath1155.68584OpenAlexW1540676724MaRDI QIDQ3595414
Publication date: 28 August 2007
Published in: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11830924_23
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Connectivity (05C40)
Related Items (6)
Approximating minimum-power degree and connectivity problems ⋮ On minimum power connectivity problems ⋮ Approximating minimum power covers of intersecting families and directed edge-connectivity problems ⋮ Approximating Steiner Networks with Node Weights ⋮ Approximating minimum-power edge-covers and 2,3-connectivity ⋮ On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
This page was built for publication: Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
