Approximating minimum power covers of intersecting families and directed edge-connectivity problems

Zeev Nutov. Approximating minimum power covers of intersecting families and directed edge-connectivity problems. Theoretical Computer Science, 411(26-28):2502-2512, 2010. [doi]

@article{Nutov10,
  title = {Approximating minimum power covers of intersecting families and directed edge-connectivity problems},
  author = {Zeev Nutov},
  year = {2010},
  doi = {10.1016/j.tcs.2010.03.009},
  url = {http://dx.doi.org/10.1016/j.tcs.2010.03.009},
  researchr = {https://researchr.org/publication/Nutov10},
  cites = {0},
  citedby = {0},
  journal = {Theoretical Computer Science},
  volume = {411},
  number = {26-28},
  pages = {2502-2512},
}