Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems

André Linhares, Chaitanya Swamy. Approximating Min-Cost Chain-Constrained Spanning Trees: A Reduction from Weighted to Unweighted Problems. In Quentin Louveaux, Martin Skutella, editors, Integer Programming and Combinatorial Optimization - 18th International Conference, IPCO 2016, Liège, Belgium, June 1-3, 2016, Proceedings. Volume 9682 of Lecture Notes in Computer Science, pages 38-49, Springer, 2016. [doi]

Abstract

Abstract is missing.