1142 search results - page 7 / 229 » Approximability of Clausal Constraints |
137
Voted
ORL
2008
15 years 3 months ago
2008
We provide a monotone O(m2/3 )-approximation algorithm for scheduling related machines with precedence constraints.
131
Voted
CP
2006
Springer
15 years 7 months ago
2006
Springer
We propose a branch and prune algorithm that is able to compute inner and outer approximations of the solution set of an existentially quantified constraint where existential param...
105
Voted
ICC
2009
IEEE
15 years 10 months ago
2009
IEEE
—In this paper, we study the problem of computing the supported QoS from a source to a destination with multiple additive constraints. The problem has been shown to be NP-complet...
141
Voted
ICALP
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We consider the scheduling problem of minimizing the average weighted job completion time on a single machine under precedence constraints. We show that this problem with...
107
Voted
SIAMJO
2008
15 years 3 months ago
2008
We study approximations of optimization problems with probabilistic constraints in which the original distribution of the underlying random vector is replaced with an empirical dis...