Sciweavers

1054 search results - page 22 / 211
» Capacitated Domination Problem
Sort
View
MP
2002
183views more  MP 2002»
15 years 2 months ago
On splittable and unsplittable flow capacitated network design arc-set polyhedra
We study the polyhedra of splittable and unsplittable single arc
Alper Atamtürk, Deepak Rajan
ICCAD
1996
IEEE
164views Hardware» more  ICCAD 1996»
15 years 6 months ago
A novel dimension reduction technique for the capacitance extraction of 3D VLSI interconnects
In this paper, we present a new capacitance extraction method named Dimension Reduction Technique (DRT) for 3D VLSI interconnects. The DRT converts a complex 3D problem into a ser...
Wei Hong II, Weikai Sun, Zhenhai Zhu, Hao Ji, Ben ...
100
Voted
DM
2006
108views more  DM 2006»
15 years 2 months ago
Optimal broadcast domination in polynomial time
Broadcast domination was introduced by Erwin in 2002, and it is a variant of the standard dominating set problem, such that different vertices can be assigned different domination...
Pinar Heggernes, Daniel Lokshtanov
DELTA
2006
IEEE
15 years 8 months ago
Minimizing Simultaneous Switching Noise (SSN) using Modified Odd/Even Bus Invert Method
In high speed digital circuits, the inductive effect is more dominant compared to capacitive effect. In particular, as the technology is shrinking, the spacing between interconnec...
K. S. Sainarayanan, J. V. R. Ravindra, M. B. Srini...
EOR
2000
74views more  EOR 2000»
15 years 2 months ago
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
We consider the single itemcapacitated lot{sizingproblem, a well-known productionplanningmodelthat often arises in practical applications, and derive new classes of valid inequali...
Andrew J. Miller, George L. Nemhauser, Martin W. P...