Add to ORKGThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1991.Includes bibliographical references (p. 211-219).by James KIimbrough Park.Ph.D
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Two approaches to architecture-independent parallel computation are investigated: a constructive fun...
AbstractIn 1963, Hoffman gave necessary and sufficient conditions under which a family of O(mn)-time...
Monge properties play an important role in theoretical computer science. Many greedy algorithms are ...
We investigate the following problems in Monge arrays and their subclasses (bitonic Monge arrays and...
. It is known that the d-dimensional axial transportation (assignment) problem can easily be solved ...
In this study of Monge properties I summarize a few aspects of the rich material based on these prop...
AbstractIt is known that the d-dimensional axial transportation (assignment) problem can easily be s...
AbstractLet C be an n × m matrix. Then the sequence j:= ((i1, j1), (i2, j2), …, (inm, jnm)) of pairs...
Let C be an n \Theta m matrix. Then the sequence S := ((i 1 ; j 1 ); (i 2 ; j 2 ); : : : ; (i nm ; j...
AbstractWe give an efficient algorithm which determines whether a condition due to Hoffman (1963) is...
We continue the research on the effects of Monge structures in the area of combinatorial optimizatio...
AbstractAn m × n matrix C is called Monge matrix if cij + crs ⩽ cis + crj for all 1 ⩽ i < r ⩽ m, 1 ⩽...
This paper's main result is an O(({radical}{bar m}lgm)(n lg n) + mlg n)-time algorithm for computing...
In embedded electronic system applications being developed today, complex datasets are required to b...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Two approaches to architecture-independent parallel computation are investigated: a constructive fun...
AbstractIn 1963, Hoffman gave necessary and sufficient conditions under which a family of O(mn)-time...
Monge properties play an important role in theoretical computer science. Many greedy algorithms are ...
We investigate the following problems in Monge arrays and their subclasses (bitonic Monge arrays and...
. It is known that the d-dimensional axial transportation (assignment) problem can easily be solved ...
In this study of Monge properties I summarize a few aspects of the rich material based on these prop...
AbstractIt is known that the d-dimensional axial transportation (assignment) problem can easily be s...
AbstractLet C be an n × m matrix. Then the sequence j:= ((i1, j1), (i2, j2), …, (inm, jnm)) of pairs...
Let C be an n \Theta m matrix. Then the sequence S := ((i 1 ; j 1 ); (i 2 ; j 2 ); : : : ; (i nm ; j...
AbstractWe give an efficient algorithm which determines whether a condition due to Hoffman (1963) is...
We continue the research on the effects of Monge structures in the area of combinatorial optimizatio...
AbstractAn m × n matrix C is called Monge matrix if cij + crs ⩽ cis + crj for all 1 ⩽ i < r ⩽ m, 1 ⩽...
This paper's main result is an O(({radical}{bar m}lgm)(n lg n) + mlg n)-time algorithm for computing...
In embedded electronic system applications being developed today, complex datasets are required to b...
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer S...
Two approaches to architecture-independent parallel computation are investigated: a constructive fun...
AbstractIn 1963, Hoffman gave necessary and sufficient conditions under which a family of O(mn)-time...