VLSI Routing in Multiple Layers using Grid based Routing Algorithms

VLSI Routing in Multiple Layers using Grid based Routing Algorithms

Aim of this paper is to describe a multi-layer grid routing algorithm which gives a better result over the existing algorithms. Given a multilayer grid routing area, considered the global routing problem of selecting a maximum set of nets, such that every net can be routed entirely in one of the given layers without violating the physical capacity constraints. The contribution of this paper is ...

Global Routing in VLSI Design: Algorithms, Theory, and Computational Practice

Global routing in VLSI (very large scale integration) design is one of the most challenging discrete optimization problems in computational theory and practice. In this paper, we present a polynomial time algorithm for the global routing problem based on an integer programming formulation. The algorithm features a theoretical approximation bound while ensuring all the routing demands are concur...

3-Dimensional VLSI Routing

Design Rules in VLSI Routing

Optimization of Multiple Vehicle Routing Problems using Approximation Algorithms

This paper deals with generating of an optimized route for multiple Vehicle routing Problems (mVRP). We used a methodology of clustering the given cities depending upon the number of vehicles and each cluster is allotted to a vehicle. kMeans clustering algorithm has been used for easy clustering of the cities. In this way the mVRP has been converted into VRP which is simple in computation compa...