Recommendations
Cites work
- scientific article; zbMATH DE number 1617243 (Why is no real title available?)
- scientific article; zbMATH DE number 3709576 (Why is no real title available?)
- scientific article; zbMATH DE number 1833416 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- An exponential time 2-approximation algorithm for bandwidth
- Approximating the bandwidth of caterpillars
- Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract)
- Complexity Results for Bandwidth Minimization
- Complexity of Finding Embeddings in a k-Tree
- Counting Subgraphs via Homomorphisms
- Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
- Even faster exact bandwidth
- Exact and Approximate Bandwidth
- Faster Exact Bandwidth
- Fourier meets M\"{o}bius: fast subset convolution
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
Cited in
(37)- Gerrymandering on graphs: computational complexity and parameterized algorithms
- Moderately exponential time and fixed parameter approximation algorithms
- An exponential time 2-approximation algorithm for bandwidth
- Computing generalized convolutions faster than brute force
- Fast Algorithms for Join Operations on Tree Decompositions
- An exponential time 2-approximation algorithm for bandwidth
- When polynomial approximation meets exact computation
- Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules
- A generic convolution algorithm for join operations on tree decompositions
- New tools and connections for exponential-time approximation
- Bandwidth and distortion revisited
- Parameterized approximation via fidelity preserving transformations
- (In)approximability of maximum minimal FVS
- Exponential approximation schemata for some network design problems
- scientific article; zbMATH DE number 5770649 (Why is no real title available?)
- Maximum Bandwidth Under Edge Addition
- An exact algorithm for minimum distortion embedding
- In)approximability of Maximum Minimal FVS
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem}
- Tractabilities and intractabilities on geometric intersection graphs
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
- Algorithms for dominating clique problems
- Even faster exact bandwidth
- Time-approximation trade-offs for inapproximable problems
- Exact and Approximate Bandwidth
- Moderately exponential approximation: bridging the gap between exact computation and polynomial approximation
- When polynomial approximation meets exact computation
- Super-polynomial approximation branching algorithms
- More effort towards multiagent knapsack
- Scheduling partially ordered jobs faster than \(2^n\)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\)
- On the parameterized complexity of b-\textsc{chromatic number}
- Faster Exact Bandwidth
- scientific article; zbMATH DE number 4120213 (Why is no real title available?)
- Sparsification and subexponential approximation
- Complement, complexity, and symmetric representation
- Approximating MAX SAT by moderately exponential and parameterized algorithms
This page was built for publication: Exact and approximate bandwidth
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708223)
