The Langberg-Médard Multiple Unicast Conjecture: Stable 3-Pair Networks

01/07/2020
by   Kai Cai, et al.
0

The Langberg-Médard multiple unicast conjecture claims that for a strongly reachable k-pair network, there exists a multi-flow with rate (1,1,...,1). In this paper, we show that the conjecture holds true for stable3-pair networks.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
02/18/2022

On The "Majority is Least Stable" Conjecture

We show that the "majority is least stable" conjecture is true for n=1 a...
research
06/09/2018

An Optimization Approach to the Langberg-Médard Multiple Unicast Conjecture

The Langberg-Médard multiple unicast conjecture claims that for any stro...
research
09/07/2023

Looms

A pair (A,B) of hypergraphs is called orthogonal if |a ∩ b|=1 for every ...
research
06/30/2020

The finiteness conjecture holds in SL(2,Z>=0)^2

Let A,B be matrices in SL(2,R) having trace greater than or equal to 2. ...
research
04/21/2003

Genetic algorithms and the Andrews-Curtis conjecture

The Andrews-Curtis conjecture claims that every balanced presentation of...
research
07/04/2019

Hardness of Bichromatic Closest Pair with Jaccard Similarity

Consider collections A and B of red and blue sets, respectively. Bichrom...
research
07/25/2019

The Strong 3SUM-INDEXING Conjecture is False

In the 3SUM-Indexing problem the goal is to preprocess two lists of elem...

Please sign up or login with your details

Forgot password? Click here to reset