Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms (Q3183480): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-642-03367-4_44 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2133668753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4414647 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof verification and the hardness of approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear degree extractors and the inapproximability of max clique and chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Approximation: Conceptual Framework and Approximability Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Parameterized Approximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Confronting hardness using a hybrid approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient approximation of Min Set Cover by moderately exponential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4910758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Set Partitioning via Inclusion-Exclusion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Approximate Solutions for Combinatorial Optimization Problems / rank
 
Normal rank

Latest revision as of 01:26, 2 July 2024

scientific article
Language Label Description Also known as
English
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
scientific article

    Statements

    Identifiers