Abstract
We study the integrality gap of the natural linear programming relaxation for the Bounded Color Matching (BCM) problem. We provide several families of......
小提示:本篇文献需要登录阅读全文,点击跳转登录