1671 search results - page 93 / 335 » On the Covering Steiner Problem |
86
Voted
CORR
2008
Springer
15 years 26 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 ...
115
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...
110
Voted
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
118
click to vote
GLVLSI
2000
IEEE
15 years 5 months ago
2000
IEEE
Circuit interconnect has become a substantial obstacle in the design of high performance systems. In this paper we explore a new routing paradigm that strikes at the root of the i...
106
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...