Pseudo-Kernelization
Pseudo-kernelization is introduced in this paper as a new strategy for improving fixed-parameter algorithms. This new technique works for bounded search tree algorithms by identifying favorable branching conditions whose absence could be used to reduce the size of corresponding problem instances. Ps...
Saved in:
| Main Author: | |
|---|---|
| Format: | article |
| Published: |
2007
|
| Online Access: | http://hdl.handle.net/10725/2770 http://dx.doi.org/10.1007/s00224-007-1344-0 http://link.springer.com/article/10.1007/s00224-007-1344-0 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|