Faster exponential-time approximation algorithms using approximate monotone local search
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 7788352 (Why is no real title available?)
- A nearly 5/3-approximation FPT Algorithm for Min-k-Cut
- A note on max k-vertex cover: faster FPT-AS, smaller approximate kernel and improved approximation
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
- A parameterized approximation scheme for min k-cut
- An FPT algorithm beating 2-approximation for \(k\)-cut
- Analysis of two-variable recurrence relations with application to parameterized approximations
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- Chamberlin-Courant rule with approval ballots: approximating the MaxCover problem with bounded frequencies in FPT time
- Constant ratio fixed-parameter approximation of the edge multicut problem
- Elements of Information Theory
- Exact algorithms via monotone local search
- Explicit Constructions of Rödl's Asymptotically Good Packings and Coverings
- Exponential-time approximation of weighted set cover
- Faster exact and approximate algorithms for k-cut
- Finding small balanced separators
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut
- New tools and connections for exponential-time approximation
- Parameterized approximation algorithms for hitting set
- Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
- Parameterized approximation via fidelity preserving transformations
- Partitioning a graph into small pieces with applications to path transversal
- Subexponential algorithms for unique games and related problems
- Vertex cover might be hard to approximate to within \(2 - \varepsilon \)
Cited in
(4)
This page was built for publication: Faster exponential-time approximation algorithms using approximate monotone local search
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6969632)
