… coding problem can be reduced to two-unicast. As a consequence, linear coding is insufficient
to achieve capacity for general two-unicast … the capacity of general two-unicast networks. …

… It is well known that the one-unicast problem is easy and … problems with small k has been
an open problem. We show that the two-unicast problem is as hard as any kunicast problem for …

… arbitrary network information flow problem seems a difficult … to be able to support two unicast
sessions by scalar network … to simultaneously support two unicast sessions at rate (1, 1). …

… the twounicast problem - properties that suggest that the bound may be tight for all two-unicast …
Unfortunately, we find that this is not the case and conclude the paper with a two-unicast “…

… In this work we propose an achievable region for the twounicast problem using linear
network codes. We consider directed acyclic networks with unit capacity edges and assume that …

… [10] first presented that butterfly network (two-unicast network) is solvable with fidelity less …
introduced to address such imperfection and low transmission rate problems. Leung et al. [11] …

… complexity of the problem are largely unknown. … 1(A) shows a network coding solution for
two unicast sessions in a … For the min-cost multiple-unicast problem, we consider k unicast …

… This problem turns out to be very hard. Dougherty et al. … For two unicast sessions, many
researchers have proposed … We postpone our solution to the former problem to the next section, …

… Abstract—We investigate the two unicast flow problem over layered linear deterministic
networks with arbitrary number of nodes. When the minimum cut value between each source…

… , [1]–[3]), the problem of multiple unicasts over multiple hops … is to make progress on
this problem for the multihop wireless … Avestimehr, “Two unicast wireless networks: characterizing …