Login / Signup
Optimal algorithms for planar over-the-cell routing in the presence of obstacles.
Srinivasa R. Danda
Sreekrishna Madhwapathy
Naveed A. Sherwani
Published in:
VLSI Design (1995)
Keyphrases
</>
worst case
orders of magnitude
learning algorithm
benchmark datasets
times faster
lower bound
computational cost
theoretical analysis
computational complexity
upper bound
shortest path
routing algorithm
greedy heuristic