Branch-and-bound and backtrack search on mesh-connected arrays of processors
From MaRDI portal
Publication:4311641
DOI10.1007/BF01184935zbMath0812.68068OpenAlexW4254081400MaRDI QIDQ4311641
Giuseppe Persiano, Christos Kaklamanis
Publication date: 14 May 1995
Published in: Mathematical Systems Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01184935
Analysis of algorithms and problem complexity (68Q25) Searching and sorting (68P10) Distributed algorithms (68W15)
Related Items (8)
Analysis of randomized load distribution for reproduction trees in linear arrays and rings ⋮ Towards optimal locality in mesh-indexings ⋮ Scheduling task-trees with additive scales on parallel/distributed machines ⋮ Scheduling task-tree with additive scales on parallel/distributed machines ⋮ Asymptotically optimal dynamic tree evolution by rapidly mixing random walks on regular networks ⋮ Towards optimal locality in mesh-indexings ⋮ Deterministic parallel backtrack search ⋮ DETERMINISTIC BRANCH-AND-BOUND ON DISTRIBUTED MEMORY MACHINES
Cites Work
This page was built for publication: Branch-and-bound and backtrack search on mesh-connected arrays of processors