Conjugate conflict continuation graphs for multi-layer constrained via minimization
type: Item
instance of: scholarly article
title: Conjugate conflict continuation graphs for multi-layer constrained via minimization
zbMATH Open document ID: 1116.68062
author: Rung-Bin Lin
author: Shuyu Chen
published in: Information Sciences
publication date: 2007-05-18T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68U07
zbMATH DE Number: 5154792
zbMATH Keywords: via minimization
zbMATH Keywords: layer assignment
zbMATH Keywords: VLSI
zbMATH Keywords: routing
zbMATH Keywords: graph coloring
MaRDI profile type: Publication
full work available at URL: j.ins.2007.01.013
OpenAlex ID: W1964044270
cites work: Fast approximation algorithms on maxcut, k-coloring, and k-color ordering for VLSI applications
cites work: A hierarchy preserving hierarchical bottom-up 2-layer wiring algorithm with respect to via minimization
cites work: Q3346242
cites work: A practical and efficient approach to the constrained via minimization problem
cites work: Evolutionary Computation in Combinatorial Optimization
cites work: Three-quarter approximation for the number of unused colors in graph coloring
DOI: 10.1016/J.INS.2007.01.013
description: scientific article; zbMATH DE number 5154792