The T-join Problem in Sparse Graphs: Applications to Phase Assignment Problem in VLSI Mask Layout
نویسندگان
چکیده
Given a graph G with weighted edges, and a subset of nodes T , the T -join problem asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A i u 2 T . We describe the applications of the T -join problem in sparse graphs to the phase assignment problem in VLSI mask layout and to conformal re nement of nite element meshes. We suggest a practical algorithm for the T join problem. In sparse graphs, this algorithm is faster than previously known methods. Computational experience with industrial VLSI layout benchmarks shows the advantages of the new algorithm.
منابع مشابه
The T - join Problem in Sparse Graphs : Applications to Phase Assignment Problem
Given a graph G with weighted edges, and a subset of nodes T, the T-join problem asks for a minimum weight edge set A such that a node u is incident to an odd number of edges of A ii u 2 T. We describe the applications of the T-join problem in sparse graphs to the phase assignment problem in VLSI mask layout and to conformal reenement of nite element meshes. We suggest a practical algorithm for...
متن کاملOptimal Phase Con ict Removal for Layout of Dark Field Alternating Phase Shifting Masks
We describe new, e cient algorithms for layout modi cation and phase assignment for dark eld alternating-type phase-shifting masks in the single-exposure regime. We make the following contributions. First, we suggest new 2-coloring and compaction approach that simultaneously optimizes layout and phase assignment which is based on planar embedding of an associated con ict graph. We also describe...
متن کاملApplying Genetic Algorithm to Dynamic Layout Problem
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...
متن کاملThe assignment heuristic for crossing reduction
Several applications use algorithms for drawing k-layered networks and, in particular, 2 layered ne tworks ( i . e . b ipart i t e graphs) . Bipartite graphs are commonly drawn in the plane so that all vertices lie on two parallel vertical lines, and an important requirement in drawing such graphs is to minimize edge crossings. Such a problem is NP-complete even when the position of the vertice...
متن کاملOffering a New Algorithm to Improve the Answer-Search Algorithm in Quadratic Assignment Problem
Layout design problem is one of the useful field of study used to increase the efficiency of sources in organizations. In order to achieve an appropriate layout design, it is necessary to define and solve the related nonlinear programming problems. Therefore, using computer in solving the related problems is important in the view of the researchers of this area of study. However, the designs pr...
متن کامل