Open problems around exact algorithms

Authors:
Gerhard J. Woeginger
Affiliations:
Department of Mathematics and Computer Science, TU Eindhoven, P.O. Box 513, 5600 MB Eindhoven, The Netherlands
Venue:
Discrete Applied Mathematics
Year:
2008

Citing 18
Cited 9

Matrix multiplication via arithmetic progressions

Journal of Symbolic Computation - Special issue on computational algebraic complexity
NP-completeness of some problems concerning voting games

International Journal of Game Theory
Inclusion and exclusion algorithm for the Hamiltonian Path Problem

Information Processing Letters
Algorithms to count paths and cycles

Information Processing Letters
Fixed-parameter tractability and completeness II: on completeness for W[1]

Theoretical Computer Science
Color-coding

Journal of the ACM (JACM)
On a class of O(n2) problems in computational geometry

Computational Geometry: Theory and Applications
A finite-difference sieve to count paths and cycles by length

Information Processing Letters
Rectangular matrix multiplication revisited

Journal of Complexity
Fast rectangular matrix multiplication and applications

Journal of Complexity
Finding maximum independent sets in sparse and general graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computing Partitions with Applications to the Knapsack Problem

Journal of the ACM (JACM)
On Feedback Problems in Diagraphs

WG '89 Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science
Lower bounds for algebraic computation trees

STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Exact algorithms for NP-hard problems: a survey

Combinatorial optimization - Eureka, you shrink!
Studies in computational geometry motivated by mesh generation

Studies in computational geometry motivated by mesh generation
On the complexity of fixed parameter clique and dominating set

Theoretical Computer Science
Dynamic programming meets the principle of inclusion and exclusion

Operations Research Letters

Fixed-parameter tractability results for feedback set problems in tournaments

Journal of Discrete Algorithms
Improved upper bounds for vertex cover

Theoretical Computer Science
Feedback vertex sets in tournaments

ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Exact algorithms for dominating set

Discrete Applied Mathematics
Scheduling partially ordered jobs faster than 2n

ESA'11 Proceedings of the 19th European conference on Algorithms
Reducing a target interval to a few exact queries

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Feedback Vertex Sets in Tournaments

Journal of Graph Theory
Homomorphic hashing for sparse coefficient extraction

IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
Space---Time tradeoffs for subset sum: an improved worst case algorithm

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.05

Visualization

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.