The following pages link to Exact and approximate bandwidth (Q708223):
Displaying 30 items.
- On the parameterized complexity of b-\textsc{chromatic number} (Q340565) (← links)
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Bandwidth and distortion revisited (Q412348) (← links)
- Approximating MAX SAT by moderately exponential and parameterized algorithms (Q477187) (← links)
- Solving the 2-disjoint connected subgraphs problem faster than \(2^n\) (Q486988) (← links)
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem} (Q489714) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- An exact algorithm for minimum distortion embedding (Q551173) (← links)
- Time-approximation trade-offs for inapproximable problems (Q1678175) (← links)
- Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem (Q1683124) (← links)
- Parameterized approximation via fidelity preserving transformations (Q1686226) (← links)
- Sparsification and subexponential approximation (Q1702300) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- Algorithms for dominating clique problems (Q1758169) (← links)
- (In)approximability of maximum minimal FVS (Q2051849) (← links)
- A generic convolution algorithm for join operations on tree decompositions (Q2117110) (← links)
- New tools and connections for exponential-time approximation (Q2272598) (← links)
- On subexponential and FPT-time inapproximability (Q2343081) (← links)
- Gerrymandering on graphs: computational complexity and parameterized algorithms (Q2670918) (← links)
- Moderately exponential time and fixed parameter approximation algorithms (Q2868915) (← links)
- Complement, Complexity, and Symmetric Representation (Q2949722) (← links)
- Super-polynomial approximation branching algorithms (Q2954364) (← links)
- Moderately Exponential Approximation: Bridging the Gap Between Exact Computation and Polynomial Approximation (Q4596147) (← links)
- Fast Algorithms for Join Operations on Tree Decompositions (Q5042462) (← links)
- When polynomial approximation meets exact computation (Q5892165) (← links)
- When polynomial approximation meets exact computation (Q5915964) (← links)
- In)approximability of Maximum Minimal FVS (Q6065391) (← links)
- Even more effort towards improved bounds and fixed-parameter tractability for multiwinner rules (Q6066767) (← links)
- Computing generalized convolutions faster than brute force (Q6185947) (← links)
