Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

1994
1994
2012
2012

Publication Types

Select...
3
3
1

Relationship

0
7

Authors

Journals

citations
Cited by 15 publications
(5 citation statements)
references
References 10 publications
0
5
0
Order By: Relevance
“…Theorem 2: The vector z is part of a feasible solution for the optimization problem (15) if and only if there exists a network code that sets up a multicast connection in the wireless network represented by hypergraph H at rate arbitrarily close to R from source s to sinks in the set T and that injects packets at rate arbitrarily close to z iJ on each hyperarc (i, J).…”
Section: Wireless Packet Networkmentioning
confidence: 99%
See 3 more Smart Citations
“…Theorem 2: The vector z is part of a feasible solution for the optimization problem (15) if and only if there exists a network code that sets up a multicast connection in the wireless network represented by hypergraph H at rate arbitrarily close to R from source s to sinks in the set T and that injects packets at rate arbitrarily close to z iJ on each hyperarc (i, J).…”
Section: Wireless Packet Networkmentioning
confidence: 99%
“…In the lossless case, we have b iJK = 1 for all non-empty K ⊂ J and b iJ∅ = 0. Hence, problem (15) simplifies to the following optimization problem. minimize f (z)…”
Section: Wireless Packet Networkmentioning
confidence: 99%
See 2 more Smart Citations
“…In the case of Steiner tree problem (e.g., [2], [11], [56], [57], [59], [75], [82], [101], [113], [189], [209][210]), the spanning tree can include additional vertices (i.e., Steiner vertices). Thus, the total weight (cost) of the resultant spanning structure can be less than in the case of the basic spanning tree problem.…”
Section: Minimum Spanning Tree and Steiner Tree Problemsmentioning
confidence: 99%