274 search results - page 38 / 55 » The Polymatroid Steiner Problems |
78
Voted
DAC
1993
ACM
15 years 4 months ago
1993
ACM
We present an efficient and effective method for the detailed routing of symmetrical or sea-of-gates FPGA architectures. Instead of breaking the problem into 2-terminal net collec...
109
Voted
SODA
2001
ACM
15 years 2 months ago
2001
ACM
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
108
click to vote
SODA
1998
ACM
15 years 2 months ago
1998
ACM
Given a planar graph on n nodes with costs weights on its edges, de ne the distance between nodes i and j as the length of the shortest path between i and j. Consider this as an i...
86
Voted
CORR
2008
Springer
15 years 24 days ago
2008
Springer
For applications to cryptography, it is important to represent numbers with a small number of non-zero digits (Hamming weight) or with small absolute sum of digits. The problem of ...
114
Voted
ASPDAC
2006
ACM
15 years 6 months ago
2006
ACM
Abstract— Routing tree construction is a fundamental problem in modern VLSI design. In this paper we propose CDCTree, an Obstacle-Avoiding Rectilinear Steiner Minimum Tree (OARSM...