Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
From MaRDI portal
Recommendations
- Moderately exponential time and fixed parameter approximation algorithms
- scientific article; zbMATH DE number 3878680
- On Approximate Solutions for Combinatorial Optimization Problems
- Efficient approximation of Min Set Cover by moderately exponential algorithms
- On the Approximability of Combinatorial Exchange Problems
- Combinatorial approximation algorithms: a comparative review
- Approximation algorithms in combinatorial scientific computing
- scientific article; zbMATH DE number 3873085
- scientific article; zbMATH DE number 3873084
Cites work
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- scientific article; zbMATH DE number 1953201 (Why is no real title available?)
- scientific article; zbMATH DE number 1559541 (Why is no real title available?)
- scientific article; zbMATH DE number 1839431 (Why is no real title available?)
- Approximation algorithms for NP-hard problems.
- Confronting hardness using a hybrid approach
- Design by measure and conquer. A faster exact algorithm for dominating set
- Efficient approximation of Min Set Cover by moderately exponential algorithms
- Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
- Linear degree extractors and the inapproximability of max clique and chromatic number
- On Approximate Solutions for Combinatorial Optimization Problems
- On Parameterized Approximability
- Parameterized Approximation Problems
- Proof verification and the hardness of approximation problems
- Set partitioning via inclusion-exclusion
- Vertex cover: Further observations and further improvements
- Vertex packings: Structural properties and algorithms
Cited in
(17)- Moderately exponential approximation for makespan minimization on related machines
- Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms
- Efficient algorithms for the max \(k\)-vertex cover problem
- Exponential approximation schemata for some network design problems
- Moderately exponential approximation
- Approximation of min coloring by moderately exponential algorithms
- Exponential-time approximation of weighted set cover
- Capacitated domination faster than O(2ⁿ)
- Approximating the exponential, the lanczos method and an Õ(m)-time spectral algorithm for balanced separator
- Preface
- Super-polynomial approximation branching algorithms
- Moderately exponential approximation: bridging the gap between exact computation and polynomial approximation
- Approximating MAX SAT by moderately exponential and parameterized algorithms
- Exact and approximate bandwidth
- Efficient algorithms for the \textsc{max~\(k\)-vertex cover problem}
- Sparsification and subexponential approximation
- Moderately exponential time and fixed parameter approximation algorithms
This page was built for publication: Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183480)
