Sciweavers

4255 search results - page 71 / 851
» Cover
Sort
View
SOFSEM
2010
Springer
14 years 6 months ago
Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph
Alexander Grigoriev, Bert Marchal, Natalya Usotska...
WALCOM
2010
IEEE
290views Algorithms» more  WALCOM 2010»
14 years 5 months ago
The Covert Set-Cover Problem with Application to Network Discovery
We address a version of the set-cover problem where we do not know the sets initially (and hence referred to as covert) but we can query an element to find out which sets contain ...
Sandeep Sen, V. N. Muralidhara
DAC
2009
ACM
14 years 4 months ago
Clock skew optimization via wiresizing for timing sign-off covering all process corners
Manufacturing process variability impacts the performance of synchronous logic circuits by means of its effect on both clock network and functional block delays. Typically, varia...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
STACS
2009
Springer
14 years 4 months ago
Cover Time and Broadcast Time
Robert Elsässer, Thomas Sauerwald
FOCS
2009
IEEE
14 years 4 months ago
Approximating Minimum Cost Connectivity Problems via Uncrossable Bifamilies and Spider-Cover Decompositions
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
Zeev Nutov