Efficient array partitioning

DOI10.1007/3-540-63165-8_216zbMath1401.68354OpenAlexW1541142209MaRDI QIDQ4571991

No author found.

Publication date: 4 July 2018

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-63165-8_216

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Approximation algorithms (68W25)

Related Items (7)

New approximation algorithm for RTILE problem. ⋮ Approximations for the general block distribution of a matrix ⋮ Two-constraint domain decomposition with space filling curves ⋮ Balanced splitting on weighted intervals ⋮ Approximations for the general block distribution of a matrix ⋮ Exploiting self‐canceling demand point aggregation error for some planar rectilinear median location problems ⋮ Guessing fractions of online sequences

Cites Work

• Mapping a chain task to chained processors
• Structured Partitioning Problems
• Efficient partitioning of sequences
• Optimal Partitioning of Sequences

This page was built for publication: Efficient array partitioning