Abstract:There is a number of VLSI problems that have a common structure. We investigate such a structure that leads to a uni ed approach for three independent VLSI layout problems: partitioning, placement and via minimization. Along the line, we rst propose a linear-time approximation algorithm on maxcut and two closely related problems: kcoloring and maximal k-color ordering problem. The k-coloring is a generalization of the maxcut and the maximal k-color ordering is a generalization of the k-coloring. For a graph G … Show more
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.