Approximate monotone local search for weighted problems
From MaRDI portal
Cites work
- A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
- A Faster FPT Algorithm and a Smaller Kernel for Block Graph Vertex Deletion
- A linear-time approximation algorithm for the weighted vertex cover problem
- A multivariate framework for weighted FPT algorithms
- A Tighter Bound for Counting Max-Weight Solutions to 2SAT Instances
- An 8-Approximation Algorithm for the Subset Feedback Vertex Set Problem
- 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
- Exact algorithms via monotone local search
- Exact exponential algorithms.
- Exponential-time approximation of weighted set cover
- Faster exponential-time approximation algorithms using approximate monotone local search
- scientific article; zbMATH DE number 7788352 (Why is no real title available?)
- Iterative compression and exact algorithms
- Mildly Exponential Time Approximation Algorithms for Vertex Cover, Balanced Separator and Uniform Sparsest Cut
- New tools and connections for exponential-time approximation
- On efficient fixed-parameter algorithms for weighted vertex cover
- Parameterized algorithms
- Subexponential algorithms for unique games and related problems
- Super-polynomial approximation branching algorithms
Cited in
(2)
This page was built for publication: Approximate monotone local search for weighted problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6926192)
