Refined Memorisation for Vertex Cover

@inproceedings{Chandran2004RefinedMF,
  title={Refined Memorisation for Vertex Cover},
  author={L. Sunil Chandran and Fabrizio Grandoni},
  booktitle={IWPEC},
  year={2004}
}
Memorisation is a technique which allows to speed up exponential recursive algorithms at the cost of an exponential space complexity. This technique already leads to the currently fastest algorithm for fixed-parameter vertex cover, whose time complexity is O(1.2832k + kn), where n is the number of nodes and k is the size of the vertex cover. Via a refined use of memorisation, we obtain a O(1.2759k + kn) algorithm for the same problem. We moreover show how to further reduce the complexity to O(1… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Finding a maximum independent set in time O(2)

J. M. Robson
Technical Report 1251-01, LaBRI, Université Bordeaux I, • 2001
View 8 Excerpts
Highly Influenced

Nondeterminism Within P

SIAM J. Comput. • 1993
View 6 Excerpts
Highly Influenced

Algorithms for Maximum Independent Sets

J. Algorithms • 1986
View 7 Excerpts
Highly Influenced

Fixed Parameter Tractability and Completeness

Complexity Theory: Current Research • 1992
View 4 Excerpts
Highly Influenced

On the complexity of vertex set problems

M. R. Fellows
Technical report, Computer Science Department, University of New Mexico, • 1988
View 4 Excerpts
Highly Influenced

and P

R. Niedermeie
Rossmanith. Private communication, • 2003
View 3 Excerpts

Similar Papers

Loading similar papers…