1671 search results - page 57 / 335 » On the Covering Steiner Problem |
FSTTCS
2007
Springer
14 years 5 months ago
2007
Springer
We consider computational problems on covering graphs with bicliques (complete bipartite subgraphs). Given a graph and an integer k, the biclique cover problem asks whether the edg...
STOC
2010
ACM
14 years 4 months ago
2010
ACM
There has been much progress on geometric set cover problems, but most known techniques only apply to the unweighted setting. For the weighted setting, very few results are known ...
ICCAD
1994
IEEE
14 years 3 months ago
1994
IEEE
We study a new placement problem: the reproducing placement problem (RPP). In each phase a module (or gate) is decomposed into two (or more) simpler modules. The goal is nd a \go...
DSN
2006
IEEE
14 years 5 months ago
2006
IEEE
Fault-tolerant time-triggered communication relies on the synchronization of local clocks. The startup problem is the problem of reaching a sufficient degree of synchronization a...
ICCAD
1999
IEEE
14 years 3 months ago
1999
IEEE
We introduce the associative skew clock routing problem, which seeks a clock routing tree such that zero skew is preserved only within identified groups of sinks. The associative ...