2 search results - page 1 / 1 » Biobjective evolutionary and heuristic algorithms for inters... |
GECCO
2006
Springer
13 years 8 months ago
2006
Springer
Wire routing in a VLSI chip often requires minimization of wire-length as well as the number of intersections among multiple nets. Such an optimization problem is computationally ...
EVOW
2006
Springer
13 years 8 months ago
2006
Springer
The k-cut problem is an NP-complete problem which consists of finding a partition of a graph into k balanced parts such that the number of cut edges is minimized. Different algori...