Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...