Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
type: Item
instance of: scholarly article
title: Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
zbMATH Open document ID: 1253.68357
DOI: 10.1007/978-3-642-03367-4_44
author: Nicolas Bourgeois
author: Bruno Escoffier
author: Vangelis Th. Paschos
published in: Lecture Notes in Computer Science
publication date: 2009-10-20T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5618384
MaRDI profile type: Publication
full work available at URL: 978-3-642-03367-4 44
OpenAlex ID: W2133668753
cites work: Q4414647
cites work: Q4258216
cites work: Q3002852
cites work: Q4782696
cites work: Proof verification and the hardness of approximation problems
cites work: Linear degree extractors and the inapproximability of max clique and chromatic number
cites work: Fixed-Parameter Approximation: Conceptual Framework and Approximability Results
cites work: On Parameterized Approximability
cites work: Parameterized Approximation Problems
cites work: Confronting hardness using a hybrid approach
cites work: Efficient approximation of Min Set Cover by moderately exponential algorithms
cites work: Vertex cover: Further observations and further improvements
cites work: Vertex packings: Structural properties and algorithms
cites work: Q4526990
cites work: Q4910758
cites work: Set Partitioning via Inclusion-Exclusion
cites work: On Approximate Solutions for Combinatorial Optimization Problems
Recommended article: Moderately exponential time and fixed parameter approximation algorithms
Recommended article: Q3343775
Recommended article: On Approximate Solutions for Combinatorial Optimization Problems
Recommended article: Efficient approximation of Min Set Cover by moderately exponential algorithms
Recommended article: On the Approximability of Combinatorial Exchange Problems
Recommended article: Combinatorial approximation algorithms: a comparative review
Recommended article: Approximation algorithms in combinatorial scientific computing
Recommended article: Q3340632
Recommended article: Q3340631
description: scientific article