252 search results - page 25 / 51 » Decremental Clique Problem |
ISAAC
2004
Springer
15 years 3 months ago
2004
Springer
Assuming 3-SAT formulas are hard to refute with high probability, Feige showed approximation hardness results, among others for the max bipartite clique. We extend this result in t...
IPPS
2000
IEEE
15 years 2 months ago
2000
IEEE
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
MST
2010
14 years 8 months ago
2010
We initiate the first systematic study of the NP-hard Cluster Vertex Deletion (CVD) problem (unweighted and weighted) in terms of fixed-parameter algorithmics. In the unweighted...
ICCTA
2007
IEEE
15 years 3 months ago
2007
IEEE
We study the dynamic version of the distributed all-pairs shortest paths problem. Most of the solutions given in the literature for this problem work under the assumption that bef...
OL
2007
14 years 9 months ago
2007
We propose a modified sequential quadratic programming (SQP) method for solving mixed-integer nonlinear programming problems. Under the assumption that integer variables have a s...