Abstract
We consider the following problem. Given a graph G = (V, E), a partition of E into k color classes, E =boolean OR(i=)(k)1 Ei, and a cost function for ......
小提示：本篇文献需要登录阅读全文，点击跳转登录
Full Text Link
