Searching for "On the k-pairs problem" – sorted by Relevance.
-
Partial multicuts in trees
- of these k pairs. This problem generalizes the well-known multicut on a tree problem, in which we
- Cited by 6 (3 self) – Add To MetaCart
-
The Number of Solutions Sufficient for Solving a Family of Problems
- generalization of this problem is the k-pairs problem, in which every problem consists of k pairs of elements
- Add To MetaCart
-
Simultaneous Solution Of Families Of Problems
- M(S) \Gamma n\Gamma1 k\Gamma1 \Delta : In a k-pair cut problem, k distinct pairs fs i ; t i g
- Add To MetaCart
-
Conservative network coding
- that commodity. More formally, we have Definition 2.2: A k-pairs communication problem is one in which each |Ti
- Cited by 3 (1 self) – Add To MetaCart
-
An efficient algorithm for minimizing a sum of Euclidean norms with applications
- = B, X∈K and (D) max B T Y s.t. S = C−A T Y, S∈K. This is the pair of problems (P ) and (D
- Cited by 18 (4 self) – Add To MetaCart
-
An Efficient Algorithm for Minimizing a Sum of P-Norms
- Xue and Ye and (D) max B T Y s:t: S = C \Gamma A T Y S 2 K. This is the pair of problems (P
- Cited by 6 (1 self) – Add To MetaCart

