2007 IEEE International Parallel and Distributed Processing Symposium 2007
DOI: 10.1109/ipdps.2007.370426
|View full text |Cite
|
Sign up to set email alerts
|

Applying Ant Colony Optimization Metaheuristic to the DAG Layering Problem

Abstract: Abstract-This paper1 presents the design and implementation of an Ant Colony Optimization based algorithm for solving the DAG Layering Problem. This algorithm produces compact layerings by minimising their width and height. Importantly it takes into account the contribution of dummy vertices to the width of the resulting layering.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 13 publications
0
1
0
Order By: Relevance
“…Section 3.1 takes a closer look at these heuristics. Another approach to create narrow layerings is presented by Andreev et al, which uses ant colony optimization [AHN07]. Nachmanson et al present an iterative algorithm to produce drawings with an aspect ratio close to a previously specified value [NRL08].…”
Section: Layer Assignmentmentioning
confidence: 99%
“…Section 3.1 takes a closer look at these heuristics. Another approach to create narrow layerings is presented by Andreev et al, which uses ant colony optimization [AHN07]. Nachmanson et al present an iterative algorithm to produce drawings with an aspect ratio close to a previously specified value [NRL08].…”
Section: Layer Assignmentmentioning
confidence: 99%