Browsing Mathematics (Faculty of) by Subject "VLSI Layout Problem"
Now showing items 1-1 of 1
-
New Convex Relaxations for the Maximum Cut and VLSI Layout Problems
(University of Waterloo, 2001)It is well known that many of the optimization problems which arise in applications are <I>hard</I>, which usually means that they are NP-hard. Hence much research has been devoted to finding <I>good</I> relaxations for ...