 We present exact and approximate contiguous partitioning algorithms that minimize the runtime of the longest-running processor under cost models that combine work factors and hypergraph communication factors .
<fluency>  We present exact and approximate contiguous partitioning algorithms that minimize the runtime of the longest-running processor under cost models that combine work factors and hypergraph communication factors .
 We present exact and approximate contiguous partitioning algorithms that minimize the runtime of the longest-running processor under cost models that combine work and hypergraph communication factors .