Improved bounds for matroid partition and intersection algorithms
SIAM Journal on Computing
Efficient theoretic and practical algorithms for linear matroid intersection problems
Journal of Computer and System Sciences
An algebraic approach to network coding
IEEE/ACM Transactions on Networking (TON)
Complexity classification of network information flow problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
IEEE Transactions on Information Theory
IEEE Transactions on Information Theory
Polynomial time algorithms for multicast network code construction
IEEE Transactions on Information Theory
On the capacity of information networks
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of matrix completion
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A unification of network coding and tree-packing (routing) theorems
IEEE/ACM Transactions on Networking (TON) - Special issue on networking and information theory
Network coding theory: single sources
Communications and Information Theory
Evolutionary algorithms and matroid optimization problems
Proceedings of the 9th annual conference on Genetic and evolutionary computation
An algebraic algorithm for weighted linear matroid intersection
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Improving FPGA routability using network coding
Proceedings of the 18th ACM Great Lakes symposium on VLSI
Theoretical Computer Science
Network coding: a computational perspective
IEEE Transactions on Information Theory
On-chip bidirectional wiring for heavily pipelined systems using network coding
ICCD'09 Proceedings of the 2009 IEEE international conference on Computer design
Overlay protection against link failures using network coding
IEEE/ACM Transactions on Networking (TON)
Deterministic Polynomial Time Algorithms for Matrix Completion Problems
SIAM Journal on Computing
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Fast deterministic algorithms for matrix completion problems
IPCO'13 Proceedings of the 16th international conference on Integer Programming and Combinatorial Optimization
| Hi-index | 0.06 |
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 matrices---taking a matrix whose entries are a mixture of numeric values and symbolic variables, and assigning values to the variables so as to maximize the resulting matrix rank. Our algorithm is faster than existing deterministic algorithms and can operate over a smaller field.