Minimum Cost for Channels and Registers in Processor Arrays by Avoiding Redundancy.

Sebastian Siegel Renate Merker

Published in: ASAP (2006)

Keyphrases

minimum cost
np hard
approximation algorithms
minimum redundancy
network flow problem
network flow
spanning tree
high speed
edit operations
network simplex algorithm
minimum cost flow
capacity constraints
undirected graph
search algorithm
np complete
special case