Exponential-time approximation schemes via compression
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 437525 (Why is no real title available?)
- scientific article; zbMATH DE number 1256718 (Why is no real title available?)
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- A Polynomial Algorithm for the k-cut Problem for Fixed k
- A new algorithm for optimal 2-constraint satisfaction and its implications
- An improved exponential-time algorithm for k -SAT
- Approximating MAX SAT by moderately exponential and parameterized algorithms
- Breaking the all subsets barrier for min \(k\)-cut
- Determinant sums for undirected Hamiltonicity
- Exact algorithms for maximum independent set
- Exact algorithms via monotone local search
- Exact exponential algorithms.
- Faster Deterministic and Las Vegas Algorithms for Offline Approximate Nearest Neighbors in High Dimensions
- Faster exact algorithms for some terminal set problems
- Fourier meets M\"{o}bius: fast subset convolution
- Improved bounds for minimal feedback vertex sets in tournaments
- Largest chordal and interval subgraphs faster than \(2^n\)
- Lower bounds based on the exponential time hypothesis
- Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
- On the minimum feedback vertex set problem: Exact and enumeration algorithms
- Parameterized algorithms
- Parameterized and Exact Computation
- Set partitioning via inclusion-exclusion
- Solving multicut faster than \(2^{n }\)
- The Complexity of Multiterminal Cuts
- The Steiner k-Cut Problem
- The complexity of satisfiability of small depth circuits
- Which problems have strongly exponential complexity?
- Worst-case study of local search for MAX-\(k\)-SAT.
This page was built for publication: Exponential-time approximation schemes via compression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6906365)
