ASPDAC
2006
ACM
14 years 4 months ago
2006
ACM
Abstract-- Shrinking process geometries and frequency scaling give rise to an increasing number of interconnects that require multiple clock cycles. This paper explores efficient t...
ICALP
2007
Springer
14 years 6 months ago
2007
Springer
Abstract. The edit distance between two ordered rooted trees with vertex labels is the minimum cost of transforming one tree into the other by a sequence of elementary operations c...
IWOCA
2009
Springer
14 years 7 months ago
2009
Springer
A minimax tree is similar to a Huffman tree except that, instead of minimizing the weighted average of the leaves’ depths, it minimizes the maximum of any leaf’s weight plus i...
STACS
2010
Springer
14 years 7 months ago
2010
Springer
We present two new approximation algorithms with (improved) constant ratios for selecting n points in n unit disks such that the minimum pairwise distance among the points is maxi...