A. J. McAllister, "A New Heuristic algorithm for the Linear Arrangement Problem ", manuscript. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
A Multi-Scale Algorithm for the Linear Arrangement Problem - Koren, Harel (2002) (5 citations) (Correct)
....implementation of spectral sequencing [14] it was very comfortable for us to use it. However, the reader that finds the implementation of spectral sequencing too complicated, may replace it with a greedy vertex by vertex successive addition algorithm. Such algorithms are described in [17] [15]. 14 Function Local Refine (G(V = Constants: interval[ 6] number of consecutive vertices to optimize together iterations[ 5] number of iterations the algorithm should run Auxiliary function: MinLAlocal(G(V,E) Ordering, j, j k 1) finds best internal ....
A. J. McAllister, "A New Heuristic algorithm for the Linear Arrangement Problem ", manuscript.
A Multi-Scale Algorithm for the Linear Arrangement Problem - Koren, Harel (2002) (5 citations) (Correct)
....iteration. However, since we have developed an extremely fast multi scale implementation of spectral sequencing [16] it was convenient to use it. Still, if the algorithm in [16] is too complicated, the reader may replace it with a greedy vertex by vertex algorithm, such as those appearing in [19, 17]. The V cycle Our basic multi scale tool is the V cycle, which starts by refining the arrangement locally. The intention of the refinement is not only to minimize the arrangement cost, but to also improve the quality of the coarsening step that follows it. The next step is to coarsen the graph ....
A. J. McAllister, "A New Heuristic Algorithm for the Linear Arrangement Problem", Technical Report 99 126a, Faculty of Computer Science, University of New Brunswick, 1999.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC