Approximating minimum-cost connectivity problems via uncrossable bifamilies

Zeev Nutov. Approximating minimum-cost connectivity problems via uncrossable bifamilies. ACM Transactions on Algorithms, 9(1):1, 2012. [doi]

@article{Nutov12-1,
  title = {Approximating minimum-cost connectivity problems via uncrossable bifamilies},
  author = {Zeev Nutov},
  year = {2012},
  doi = {10.1145/2390176.2390177},
  url = {http://doi.acm.org/10.1145/2390176.2390177},
  researchr = {https://researchr.org/publication/Nutov12-1},
  cites = {0},
  citedby = {0},
  journal = {ACM Transactions on Algorithms},
  volume = {9},
  number = {1},
  pages = {1},
}