Kernelization algorithms for the vertex cover problem
A variety of efficient kernelization strategies for the classic vertex cover problem are developed, implemented and compared experimentally. A new technique, termed crown reduction, is introduced and analyzed. Applications to computational biology are discussed.
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , , , |
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5409 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://www.siam.org/meetings/alenex04/abstacts/F-Abu-Khzam.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|