NobleBlocks
Public

Deterministic network coding by matrix completion

Published in Symposium on Discrete Algorithms • Jan 23, 2005
NobleIDNI0P36W00R16S97
Authors:
Nicholas J. A. Harvey
,
David R. Karger
,
Kazuo Murota

Abstract

We present a new deterministic algorithm to construct network codes for multicast problems, a particular class of network information ow problems. Our algorithm easily generalizes to several variants of multicast problems. Our approach is based on a new algorithm for maximum-rank completion of mixed...

Finding related papers...

Discussions

(0)

No comments yet

Be the first to share your thoughts!