routing other data flows and excessive spacing at the edges of the diagram and insufficient spacing in the center of the diagram. ... The quadratic assignment problem has been shown to be NP-complete (Garey, Johnson and Stockmeyer, 1974). ... wise iteration algorithm (Steinberg, 1961), two relaxation methods (Fisk, 1967; and Quinn, 1979) and the Monte Carlo ... algorithms for DFD placement ROUTING The four subproblems within the wiring problem are wire list determination, anbsp;...
|Title||:||Proceedings of the ... International Conference on Information Systems|