7006 search results - page 237 / 1402 » Approximation Algorithms |
110
click to vote
RTSS
2002
IEEE
15 years 8 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
111
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Approximations can aim at having close to optimal value or, alternatively, they can aim at structurally resembling an optimal solution. Whereas value-approximation has been extensi...
161
click to vote
IPCO
1998
15 years 4 months ago
1998
Abstract. A well studied and difficult class of scheduling problems concerns parallel machines and precedence constraints. In order to model more realistic situations, we consider ...
128
Voted
CORR
2010
Springer
15 years 2 months ago
2010
Springer
The Maximum Betweenness Centrality problem (MBC) can be defined as follows. Given a graph find a k-element node set C that maximizes the probability of detecting communication be...
120
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...