Distributed Optimization for Combinatorial Coding Subgraph Selection Problems

Many network design cases with network coding can be formulated as combinatorial optimization problems, which are NP-hard and hard to approximate even in a centralized manner. In this paper, guided by Markov approximation framework, we provide a unified distributed solution for one important sub-cat... View More