Fast, effective vertex cover kernelization
Summary form only given. Two kernelization methods for the vertex cover problem are investigated. The first, LP-kernelization has been in prior use and is known to produce predictable results. The second, crown reduction, is newer and faster but generates more variable results. Previously-unknown co...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | conferenceObject |
| Published: |
2017
|
| Online Access: | http://hdl.handle.net/10725/5406 http://dx.doi.org/10.1006/bbrc.1994.188310.1109/AICCSA.2005.1387015 http://libraries.lau.edu.lb/research/laur/terms-of-use/articles.php http://ieeexplore.ieee.org/abstract/document/1387015/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|