Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems

DOI10.1007/11830924_23MaRDI QIDQ3595414zbMATH OpenOpenAlexFDO

Authors Zeev Nutov

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

Mathematics Subject Classification ID

Connectivity (05C40) Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Approximating minimum power covers of intersecting families and directed edge-connectivity problems
• On Minimum Power Connectivity Problems
• On minimum power connectivity problems
• Power optimization for connectivity problems
• Power Optimization for Connectivity Problems

Cited in

(7)

• Listing minimal edge-covers of intersecting families with applications to connectivity problems
• Approximating minimum-power edge-covers and 2,3-connectivity
• On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
• Approximating Steiner Networks with Node Weights
• Approximating minimum-power degree and connectivity problems
• On minimum power connectivity problems
• Approximating minimum power covers of intersecting families and directed edge-connectivity problems

This page was built for publication: Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595414)