681 search results - page 61 / 137 » General Polynomial Time Decomposition Algorithms |
131
Voted
SODA
2010
ACM
14 years 11 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
110
click to vote
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...
93
Voted
CCS
2007
ACM
15 years 6 months ago
2007
ACM
In order to provide certified security services we must provide indicators that can measure the level of assurance that a complex business process can offer. Unfortunately the fo...
82
Voted
SIAMDM
1998
15 years 4 days ago
1998
The richest class of t-perfect graphs known so far consists of the graphs with no so-called odd-K4. Clearly, these graphs have the special property that they are hereditary t-perfe...
80
Voted
INFOCOM
2008
IEEE
15 years 6 months ago
2008
IEEE
—A fundamental problem in wireless networks is to estimate its throughput capacity - given a set of wireless nodes, and a set of connections, what is the maximum rate at which da...