Approximating minimum power covers of intersecting families and directed edge-connectivity problems
From MaRDI portal
Publication:974743
DOI10.1016/J.TCS.2010.03.009zbMATH Open1207.68446OpenAlexW2037416519MaRDI QIDQ974743FDOQ974743
Authors: Zeev Nutov 
Publication date: 7 June 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.03.009
Recommendations
approximation algorithmsdirected graphswireless networksedge-connectivityintersecting familiespower minimization
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- Increasing the rooted connectivity of a digraph by one
- Network lifetime and power assignment in ad hoc wireless networks
- Power optimization for connectivity problems
- On minimum power connectivity problems
- Matroid Intersection
- Title not available (Why is that?)
- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
- Approximating Minimum-Power Degree and Connectivity Problems
- Power assignment for \(k\)-connectivity in wireless ad hoc networks
- Approximating Steiner Networks with Node Weights
- Energy-efficient wireless network design
Cited In (10)
- An \(O(\sqrt{k})\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
- Listing minimal edge-covers of intersecting families with applications to connectivity problems
- Approximating Minimum Power Covers of Intersecting Families and Directed Connectivity Problems
- Polylogarithmic Approximation Algorithm for k-Connected Directed Steiner Tree on Quasi-Bipartite Graphs
- Approximating minimum-power degree and connectivity problems
- A \(2\sqrt{2k}\)-approximation algorithm for minimum power \(k\) edge disjoint \(st\)-paths
- Improved approximation algorithms for minimum power covering problems
- On rooted \(k\)-connectivity problems in quasi-bipartite digraphs
- Survivable network activation problems
- Approximating minimum power edge-multi-covers
This page was built for publication: Approximating minimum power covers of intersecting families and directed edge-connectivity problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q974743)
