Expected computation time for Hamiltonian path problem
SIAM Journal on Computing
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
On the complexity of dynamic programming for sequencing problems with precedence constraints
Annals of Operations Research
Dynamic Programming Treatment of the Travelling Salesman Problem
Journal of the ACM (JACM)
Exact Bayesian Structure Discovery in Bayesian Networks
The Journal of Machine Learning Research
On exact algorithms for treewidth
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings
Algorithmica - Parameterized and Exact Algorithms
The Travelling Salesman Problem in Bounded Degree Graphs
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Treewidth Computation and Extremal Combinatorics
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Computing the Tutte Polynomial in Vertex-Exponential Time
FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Finding, minimizing, and counting weighted subgraphs
Proceedings of the forty-first annual ACM symposium on Theory of computing
Relationships between nondeterministic and deterministic tape complexities
Journal of Computer and System Sciences
Exact structure discovery in Bayesian networks with less space
UAI '09 Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence
Covering and packing in linear space
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
On exact algorithms for treewidth
ACM Transactions on Algorithms (TALG)
Finding optimal Bayesian networks using precedence constraints
The Journal of Machine Learning Research
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
On exact algorithms for the permutation CSP
Theoretical Computer Science
| Hi-index | 0.00 |
Many combinatorial problems---such as the traveling salesman, feedback arcset, cutwidth, and treewidth problem---can be formulated as finding a feasible permutation of n elements. Typically, such problems can be solved by dynamic programming in time and space O* (2n), by divide and conquer in time O* (4n) and polynomial space, or by a combination of the two in time O* (4n2-s) and space O* (2s) for s = n, n/2, n/4,.... Here, we show that one can improve the tradeoff to time O* (Tn) and space O* (Sn) with TS S n elements such that every linear order is an extension of one member of the family. Our construction is optimal within a natural class of partial order families.