7129 search results - page 269 / 1426 » Approximation Algorithms for Treewidth |
150
click to vote
SDM
2008
SIAM
15 years 5 months ago
2008
SIAM
It has long been noted that many data mining algorithms can be built on top of join algorithms. This has lead to a wealth of recent work on efficiently supporting such joins with ...
147
click to vote
IWOCA
2009
Springer
15 years 11 months ago
2009
Springer
: We present an improved upper bound of O(d1+ 1 m−1 ) for the (2, F)-subgraph chromatic number χ2,F (G) of any graph G of maximum degree d. Here, m denotes the minimum number of...
183
click to vote
STOC
2012
ACM
13 years 6 months ago
2012
ACM
The Chow parameters of a Boolean function f : {−1, 1}n → {−1, 1} are its n + 1 degree-0 and degree-1 Fourier coefficients. It has been known since 1961 [Cho61, Tan61] that ...
153
click to vote
ESA
2001
Springer
15 years 9 months ago
2001
Springer
In this paper we describe a general grouping technique to devise faster and simpler approximation schemes for several scheduling problems. We illustrate the technique on two diff...
121
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We introduce a new approach to computing an approximately maximum s-t flow in a capacitated, undirected graph. This flow is computed by solving a sequence of electrical flow probl...