1. A constant-factor approximation for the generalized cable-trench problem;Benedito,2019
2. Berman, P., Karpinski, M., 2003. Improved approximation lower bounds on small occurence optimization. ECCC Report.
3. Berman, P., Karpinski, M., Scott, A.D., 2003. Approximation hardness and satisfiability of bounded occurrence instances of SAT. Technical Report. SIS-2003-269.
4. A benders decomposition based framework for solving cable trench problems;Calik;Computers & Operations Research,2017
5. Chekuri, C., Khanna, S., Naor, J., 2001. A deterministic algorithm for the cost-distance problem, in: Symposium on Discrete Algorithms: Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms, pp. 232–233.