Learn More
In this report we study the oating random walk method for Capacitance Estimation in VLSI circuits. The aspects studied are the time complexity of the algorithm, error reduction and ways to speed the algorithm. For algorithms such as these, most of the analysis done in the literature is based only on experimental results. We take a theoretical approach(More)
In this work we consider the Single Track Train Scheduling Problem. The problem consists in scheduling a set of trains from opposite sides along a single track. The track passes intermediate stations and the trains are only allowed to pass each other at those stations. This problem has a close relation to minimizing the makespan in a job shop scheduling(More)
A graph is planar if it can be drawn in the plane without edges crossing. More formally, a graph is planar if it has an embedding in the plane, in which each vertex is mapped to a distinct point P (v), and edge (u, v) to simple curves connecting P (u), P (v), such that curves intersect only at their endpoints. graph which each partition having 3 vertices.(More)
Acknowledgement I would like to thank my guide, Prof. Soumen Chakrabarti for the consistent motivation and direction he has fed into my work. I would also like to thank Prof. Abhiram Ranade for his invaluable inputs and suggestions regarding the Reverse Push algorithm. My thanks to Prof. Sohoni who pitched in at the right time with sound advice. Finally, I(More)