Conjugate conflict continuation graphs for multi-layer constrained via minimization

DOI10.1016/j.ins.2007.01.013zbMath1116.68062OpenAlexW1964044270MaRDI QIDQ881874

Rung-Bin Lin, Shu-Yu Chen

Publication date: 18 May 2007

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2007.01.013

zbMATH Keywords

graph coloringVLSIroutinglayer assignmentvia minimization

Mathematics Subject Classification ID

Computer science aspects of computer-aided design (68U07) Graph theory (including graph drawing) in computer science (68R10)

Related Items (3)

A simple simulated annealing algorithm for the maximum clique problem ⋮ Combining clustered adaptive multistart and discrete dynamic convexized method for the max-cut problem ⋮ Speeding up a memetic algorithm for the max-bisection problem

Cites Work

• Unnamed Item
• Three-quarter approximation for the number of unused colors in graph coloring
• A practical and efficient approach to the constrained via minimization problem
• A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization
• Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications
• Evolutionary Computation in Combinatorial Optimization

This page was built for publication: Conjugate conflict continuation graphs for multi-layer constrained via minimization