7006 search results - page 179 / 1402 » Approximation Algorithms |
135
click to vote
DLT
2009
15 years 26 days ago
2009
Abstract. We consider algorithms for approximating context
146
click to vote
CORR
2008
Springer
15 years 3 months ago
2008
Springer
This paper presents improved approximation algorithms for the problem of multiprocessor scheduling under uncertainty (SUU), in which the execution of each job may fail probabilist...
141
click to vote
DAM
2006
15 years 3 months ago
2006
Subtree filament graphs are the intersection graphs of subtree filaments in a tree. This class of graphs contains subtree overlap graphs, interval filament graphs, chordal graphs,...
128
click to vote
CCCG
2007
15 years 4 months ago
2007
A path from a point s to a point t on the surface of a polyhedral terrain is said to be descent if for every pair of points p = (x(p), y(p), z(p)) and q = (x(q), y(q), z(q)) on th...
248
click to vote
WADS
2009
Springer
15 years 9 months ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...