Efficient median finding and its application to two-variable linear programming on mesh-connected computers with multiple broadcasting

DOI10.1016/0743-7315(92)90061-QzbMath0763.68037OpenAlexW2057161655MaRDI QIDQ1200140

Yen-Cheng Chen, Wen-Tsuen Chen

Publication date: 17 January 1993

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0743-7315(92)90061-q

zbMATH Keywords

two-variable linear programmingmedian problem2-dimensional mesh-connected computersmultiple broadcastingprune-and-search strategy

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Linear programming (90C05) General theory of computer systems (68M01)

Related Items (2)

Geometric approach for optimal routing on a mesh with buses ⋮ Scalable algorithms for the mesh with buses: merging, sorting and selection

This page was built for publication: Efficient median finding and its application to two-variable linear programming on mesh-connected computers with multiple broadcasting