2957 search results - page 408 / 592 » The Complexity of Polynomial-Time Approximation |
165
click to vote
ANTSW
2006
Springer
15 years 10 months ago
2006
Springer
Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
115
click to vote
CSB
2004
IEEE
15 years 10 months ago
2004
IEEE
Alternative transcription, in which a single gene may give rise to multiple variant mRNA forms, is widely recognized as an important source of protein diversity in complex, eukary...
161
click to vote
DATE
2004
IEEE
15 years 10 months ago
2004
IEEE
This paper proposes a new hierarchical circuit modeling and simulation technique in s-domain for linear analog circuits. The new algorithm can perform circuit complexity reduction...
207
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
We consider the minimum line covering problem: given a set S of n points in the plane, we want to find the smallest number l of straight lines needed to cover all n points in S. W...
175
click to vote
CIAC
2006
Springer
15 years 10 months ago
2006
Springer
Complementing recent progress on classical complexity and polynomial-time approximability of feedback set problems in (bipartite) tournaments, we extend and partially improve fixed...