R. Govindan, M. Langston and S. Ramachandramurthi, "A Practical Approach to Layout Optimization," Proceedings of the International Conference on VLSI Design, Bombay, India, January 1992. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Parameterized Complexity: A Framework for Systematically.. - Downey, Fellows, Stege (1997) (41 citations) (Correct)
....they point out that this is a reasonable preface for any algorithmic attack on these kinds of problems. Our Algorithm 4.5 can be viewed in part as an example of this strategy. Langston et al. have similarly used approximate obstruction sets to design heuristics for VLSI layout problems [LR91, GLR92]. Example 4.3 (Iterative Approximation Heuristics) An important example of a much used approximation heuristic is the k Opt heuristic for the Traveling Salesman Problem [JMc97] This can be viewed as a simple example of the following general recipe for the design of local search heuristics based ....
R. Govindan, M. Langston and S. Ramachandramurthi, "A Practical Approach to Layout Optimization," Proceedings of the International Conference on VLSI Design, Bombay, India, January 1992.
Tools for mapping applications to CCMs - Mark Jones Michael (1998) Self-citation (Langston) (Correct)
No context found.
R. Govindan, M. A. Langston, and S. Ramachandramurthi, #A practical approachtolayout optimization,"in Sixth International Conference on VLSI Design, pp. 222#225, 1993.
The Structure And Number Of Obstructions To Treewidth - Siddharthan.. Self-citation (Ramachandramurthi) (Correct)
....w 4. The pathwidth of a graph is a concept akin to treewidth (see [9, 17] for example) There has been considerable interest in the obstructions for treewidth and for pathwidth [6, 14, 17, 19, 27] Obstruction based algorithms have been used for integrated circuit design and other applications [12, 15, 18]. The reasons for studying the obstructions are two fold. First, a better comprehension of their structure and number can help one design better algorithms for the fixed parameter problem. Second, being minimal graphs, analyzing their structure can give us insights into developing better lower ....
....this were true, then it would follow that for every w # 3, obs(TW(w) ## obs(PW(w) Unfortunately, we have been unable to verify this conjecture. Although an explicit knowledge of the obstructions may be helpful in the design of practical algorithms to decide membership in TW(w)orPW(w) see [15, 21], for instance) the rapid growth of the number of obstructions of order w 3 with increasing w poses a formidable new challenge. One way to surmount this potential di#culty would be to develop general tests for entire families of structurally related obstructions rather than test for each ....
R. Govindan, M. A. Langston, and S. Ramachandramurthi, A practical approach to layout optimization, in Proc. 6th International Conference on VLSI Design, Bombay, India, 1993, pp. 222--225.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC