144 search results - page 9 / 29 » A Polynomial Time Approximation Scheme for the Square Packin... |
157
click to vote
DISOPT
2010
15 years 3 months ago
2010
While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few studies abou...
156
Voted
ICTCS
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we study the job shop scheduling problem under the assumption that the jobs have controllable processing times. The fact that the jobs have controllable processing t...
163
Voted
SODA
2012
ACM
13 years 6 months ago
2012
ACM
Kernelization algorithms are polynomial-time reductions from a problem to itself that guarantee their output to have a size not exceeding some bound. For example, d-Set Matching f...
106
Voted
FCT
2003
Springer
15 years 9 months ago
2003
Springer
The closest substring problem, where a short string is sought that minimizes the number of mismatches between it and each of a given set of strings, is a minimization problem with ...
145
Voted
ISPD
2009
ACM
15 years 10 months ago
2009
ACM
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...