Improved algorithms for path, matching, and packing problems

@inproceedings{Chen2007ImprovedAF,
  title={Improved algorithms for path, matching, and packing problems},
  author={Jianer Chen and Songjian Lu and Sing-Hoi Sze and Fenghui Zhang},
  booktitle={SODA},
  year={2007}
}
Improved randomized and deterministic algorithms are presented for PATH, MATCHING, and PACKING problems. Our randomized algorithms are based on the divide-and-conquer technique, and improve previous best algorithms for these problems. For example, for the <i>k</i>-PATH problem, our randomized algorithm runs in time <i>O</i>(4<sup><i>k</i></sup>k<sup>3.42</sup><i>m</i>) and space <i>O</i>(<i>nk</i>log<i>k</i> + <i>m</i>), improving the previous best randomized algorithm for the problem that runs… CONTINUE READING

From This Paper

Topics from this paper.
61 Citations
6 References
Similar Papers

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…