Open problems around exact algorithms
From MaRDI portal
Recommendations
- Parameterized and Exact Computation
- scientific article; zbMATH DE number 1953201
- scientific article; zbMATH DE number 4077311
- scientific article; zbMATH DE number 866556
- scientific article; zbMATH DE number 799791
- Open questions in complexity theory for numerical optimization
- Exact algorithms for difficult graph problems
- scientific article; zbMATH DE number 3902037
- scientific article; zbMATH DE number 3910647
Cites work
- scientific article; zbMATH DE number 3910446 (Why is no real title available?)
- scientific article; zbMATH DE number 1305487 (Why is no real title available?)
- scientific article; zbMATH DE number 1332665 (Why is no real title available?)
- scientific article; zbMATH DE number 1351079 (Why is no real title available?)
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- scientific article; zbMATH DE number 219267 (Why is no real title available?)
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- A Dynamic Programming Approach to Sequencing Problems
- A Separator Theorem for Planar Graphs
- A \(2^{|E|/4}\)-time algorithm for MAX-CUT
- A finite-difference sieve to count paths and cycles by length
- A lower bound of \({1\over 2}n^2\) on linear search programs for the knapsack problem
- A note on the complexity of the chromatic number problem
- Algorithms for maximum independent sets
- Algorithms to count paths and cycles
- Applications of a Planar Separator Theorem
- Automata, Languages and Programming
- Color-coding
- Computing Partitions with Applications to the Knapsack Problem
- Dynamic programming meets the principle of inclusion and exclusion
- Fast rectangular matrix multiplication and applications
- Faster algorithms for computing power indices in weighted voting games
- Finding a Maximum Independent Set
- Finding a Minimum Circuit in a Graph
- Fixed-parameter tractability and completeness II: On completeness for W[1]
- Hamilton Paths in Grid Graphs
- Inclusion and exclusion algorithm for the Hamiltonian path problem
- Matrix multiplication via arithmetic progressions
- NP-completeness of some problems concerning voting games
- On a class of \(O(n^ 2)\) problems in computational geometry
- On enumerating all minimal solutions of feedback problems
- On maximal transitive subtournaments
- On the complexity of fixed parameter clique and dominating set
- Rectangular matrix multiplication revisited
- The complexity of the travelling repairman problem
- The searching over separators strategy to solve some NP-hard problems in subexponential time
- The traveling salesman problem for cubic graphs.
Cited in
(27)- An introduction to exponential time exact algorithms for solving NP-hard problems
- Solving larger maximum clique problems using parallel quantum annealing
- Exact algorithms for dominating set
- Classical and quantum algorithms for variants of subset-sum via dynamic programming
- Complement, complexity, and symmetric representation
- Improved bounds for minimal feedback vertex sets in tournaments
- Improved upper bounds for vertex cover
- A note on the intersection property for flat boxes and boxicity in \(\mathbb R^d\)
- If the current clique algorithms are optimal, so is Valiant's parser
- Exact algorithms for finding longest cycles in claw-free graphs
- Feedback vertex sets in tournaments
- Solving the job-shop scheduling problem optimally by dynamic programming
- On comparing algorithms for the maximum clique problem
- Theory and methodology of time-dependent scheduling: past, present and future
- Parameterized algorithms on integer sets with small doubling: integer programming, subset sum and k-SUM
- scientific article; zbMATH DE number 7525510 (Why is no real title available?)
- Exact algorithms for counting 3-colorings of graphs
- A general reduction theorem with applications to pathwidth and the complexity of Max 2-CSP
- Improved information set decoding for code-based cryptosystems with constrained memory
- Faster graph coloring in polynomial space
- scientific article; zbMATH DE number 4077311 (Why is no real title available?)
- Quantum algorithms for one-sided crossing minimization
- Quantum algorithms for one-sided crossing minimization
- An ETH-Tight Exact Algorithm for Euclidean TSP
- Fixed-parameter tractability results for feedback set problems in tournaments
- Scheduling partially ordered jobs faster than \(2^n\)
- Sex-equal stable matchings: complexity and exact algorithms
This page was built for publication: Open problems around exact algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2473037)
