50 search results - page 4 / 10 » Improved approximation algorithms for rectangle tiling and p... |
VC
2011
14 years 4 months ago
2011
Abstract We present an algorithm for computing families of geodesic curves over an open mesh patch to partition the patch into strip-like segments. Specifically, the segments can ...
EUROPAR
2010
Springer
14 years 9 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
IFIP
2004
Springer
15 years 3 months ago
2004
Springer
We study the general packing problem with M constraints. In [Jansen and Zhang, TCS 2002] a c(1 + ε)-approximation algorithm for the general packing problem was proposed. A block s...
108
Voted
MOR
2000
14 years 9 months ago
2000
Given a network and a set of connection requests on it, we consider the maximum edge-disjoint paths and related generalizations and routing problems that arise in assigning paths f...
88
Voted
WADS
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...