79 search results - page 9 / 16 » Improved approximation algorithms for multidimensional bin p... |
88
Voted
PPSN
1998
Springer
15 years 1 months ago
1998
Springer
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
105
click to vote
IFIPTCS
2010
14 years 7 months ago
2010
We present in this paper a 5/2-approximation algorithm for scheduling rigid jobs on multi-organizations. For a given set of n jobs, the goal is to construct a schedule for N organi...
VTC
2007
IEEE
15 years 3 months ago
2007
IEEE
— This paper presents a novel generalised Multi-Carrier Direct Sequence Code Division Multiple Access (MC DS-CDMA) system invoking smart antennas for improving the achievable per...
WADS
2001
Springer
15 years 1 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...
MFCS
2005
Springer
15 years 3 months ago
2005
Springer
We study online interval coloring problems with bandwidth. We are interested in some variants motivated by bin packing problems. Specifically we consider open-end coloring, cardin...