187 search results - page 23 / 38 » Improved Approximation of MAX-CUT on Graphs of Bounded Degre... |
EACL
2006
ACL Anthology
13 years 9 months ago
2006
ACL Anthology
We investigate a series of graph-theoretic constraints on non-projective dependency parsing and their effect on expressivity, i.e. whether they allow naturally occurring syntactic...
ESA
2001
Springer
14 years 6 days ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
JCT
2007
13 years 7 months ago
2007
Let G be a d-regular graph with girth g, and let α be the independence number of G. We show that α(G) ≥ 1 2 1 − (d − 1)−2/(d−2) − (g) n where (g) → 0 as g → ∞,...
COLT
2007
Springer
14 years 1 months ago
2007
Springer
We present a new class of problems, called resource-bounded information gathering for correlation clustering. Our goal is to perform correlation clustering under circumstances in w...
FUIN
2006
13 years 7 months ago
2006
In this paper we deal with the problem of finding an optimal query execution plan in database systems. We improve the analysis of a polynomial-time approximation algorithm due to M...