Sciweavers

274 search results - page 39 / 55
» The Polymatroid Steiner Problems
Sort
View
110
Voted
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
15 years 6 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- 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...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
GLVLSI
2000
IEEE
145views VLSI» more  GLVLSI 2000»
15 years 5 months ago
Manhattan or non-Manhattan?: a study of alternative VLSI routing architectures
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...
Cheng-Kok Koh, Patrick H. Madden
106
Voted
SODA
2008
ACM
128views Algorithms» more  SODA 2008»
15 years 2 months ago
Analysis of greedy approximations with nonsubmodular potential functions
In this paper, we present two techniques to analyze greedy approximation with nonsubmodular functions restricted submodularity and shifted submodularity. As an application of the ...
Ding-Zhu Du, Ronald L. Graham, Panos M. Pardalos, ...
CVGIP
2004
169views more  CVGIP 2004»
15 years 16 days ago
Contour interpolation by straight skeletons
In this paper we present an efficient method for interpolating a piecewise-linear surface between two parallel slices, each consisting of an arbitrary number of (possibly nested) ...
Gill Barequet, Michael T. Goodrich, Aya Levi-Stein...
103
Voted
ICALP
2005
Springer
15 years 6 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...