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]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.