Approximation algorithms for array partitioning problems

DOI10.1016/j.jalgor.2003.11.006zbMath1090.68118OpenAlexW1981348564MaRDI QIDQ4651813

No author found.

Publication date: 22 February 2005

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jalgor.2003.11.006

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (3)

Load-balancing spatially located computations using rectangular partitions ⋮ Balanced splitting on weighted intervals ⋮ RELATIONS BETWEEN TWO COMMON TYPES OF RECTANGULAR TILINGS

This page was built for publication: Approximation algorithms for array partitioning problems