Paths through a maze of rectangles

DOI10.1002/net.3230220404zbMath0756.68045OpenAlexW1986610326MaRDI QIDQ4018994

E. N. Gilbert, Edward G. jun. Coffman

Publication date: 16 January 1993

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230220404

zbMATH Keywords

heuristic algorithmsroboticsshort pathsmazes of rectanglesVLSI wire-routing

Mathematics Subject Classification ID

Combinatorial properties of polytopes and polyhedra (number of faces, shortest paths, etc.) (52B05) Parallel algorithms in computer science (68W10) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)

This page was built for publication: Paths through a maze of rectangles