422 search results - page 13 / 85 » On Non-Approximability for Quadratic Programs |
149
click to vote
ANOR
2005
15 years 5 months ago
2005
: The vertex coloring problem has been the subject of extensive research for many years. Driven by application potential as well as computational challenge, a variety of methods ha...
153
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper we introduce two new methods for solving binary quadratic problems. While spectral relaxation methods have been the workhorse subroutine for a wide variety of comput...
140
click to vote
ASPDAC
1999
ACM
15 years 10 months ago
1999
ACM
We present an algorithm for solving a general min-cut, twoway partitioning problem subject to timing constraints. The problem is formulated as a constrained programming problem an...
126
click to vote
ICCAD
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper considers the problem of determining an optimal clock skew schedule for a synchronous VLSI circuit. A novel formulation of clock skew scheduling as a constrained quadrat...
133
click to vote
ICCAD
1995
IEEE
15 years 9 months ago
1995
IEEE
With an ever-increasing portion of the delay in highspeed CMOS chips attributable to the interconnect, interconnect-circuit design automation continues to grow in importance. By t...