1054 search results - page 26 / 211 » Capacitated Domination Problem |
159
click to vote
ASPDAC
2001
ACM
15 years 9 months ago
2001
ACM
Clock-tuning has been classified as important but tough tasks due to the non-convex nature caused by the skew requirements. As a result, all existing mathematical programming appr...
128
click to vote
VLSID
2004
IEEE
16 years 6 months ago
2004
IEEE
Reduction of worst-case delay and delay uncertainty due to capacitive coupling is a still unsolved problem in physical design. We describe a routing only layout solution - swizzli...
173
click to vote
ESA
2007
Springer
16 years 3 days ago
2007
Springer
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
154
click to vote
CIAC
2010
Springer
15 years 9 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...
186
click to vote
ISPD
1999
ACM
15 years 10 months ago
1999
ACM
In this paper, we consider delay optimization in multilayer detailed routing. Given a detailed routing by some detailed router, we iteratively improve the delays of critical nets ...