Open problems around exact algorithms |
| |
| Authors: | Gerhard J. Woeginger |
| |
| Affiliation: | Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands |
| |
| Abstract: | We list a number of open questions around worst case time bounds and worst case space bounds for NP-hard problems. We are interested in exponential time solutions for these problems with a relatively good worst case behavior. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. |
| |
| Keywords: | Combinatorial optimization Computational complexity |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
