1054 search results - page 1 / 211 » Capacitated Domination Problem |
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
![Planar Capacitated Dominating Set Is W[1]-Hard](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Planar Capacitated Dominating Set Is W[1]-Hard")
Given a graph G together with a capacity function c : V (G) → N, we call S ⊆ V (G) a capacitated dominating set if there exists a mapping f : (V (G) \ S) → S which maps every...
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
MST
2010
12 years 11 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
ASPDAC
2005
ACM
13 years 6 months ago
2005
ACM
Abstract— As VLSI technology enters the ultra-deep submicron era, wire coupling capacitance starts to dominate self capacitance and can no longer be neglected in timing driven ro...
ASPDAC
2004
ACM
13 years 10 months ago
2004
ACM
With the exponential reduction in the scaling of feature size, inter-wire coupling capacitance becomes the dominant part of load capacitance. Two problems are introduced by coupli...