95 search results - page 2 / 19 » A Faster, Better Approximation Algorithm for the Minimum Lat... |
104
click to vote
APPROX
2006
Springer
15 years 6 months ago
2006
Springer
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...
116
Voted
ASPDAC
1999
ACM
15 years 7 months ago
1999
ACM
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 ...
116
click to vote
APPROX
2008
Springer
15 years 4 months ago
2008
Springer
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...
134
click to vote
ISPD
2009
ACM
15 years 9 months ago
2009
ACM
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...
110
click to vote
FOCS
2003
IEEE
15 years 8 months ago
2003
IEEE
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...