Structure in approximation classes

DOI10.1007/BFB0030875zbMATH Open1527.68085OpenAlexW1516959859MaRDI QIDQ6085751FDOQ6085751

Viggo Kann, Riccardo Silvestri, Pilu Crescenzi, Luca Trevisan

Publication date: 12 December 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0030875

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Approximation algorithms for combinatorial problems
• The complexity of optimization problems
• Optimization, approximation, and complexity classes
• The NP-Completeness of Edge-Coloring
• On the Structure of Polynomial Time Reducibility
• Title not available (Why is that?)
• Title not available (Why is that?)
• On the hardness of approximating minimization problems
• On the complexity of approximating the independent set problem
• Strong lower bounds on the approximability of some NPO PB-complete maximization problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Completeness in approximation classes
• On the approximability of the maximum common subgraph problem
• The approximation of maximum subgraph problems
• On Syntactic versus Computational Views of Approximability
• Title not available (Why is that?)
• Title not available (Why is that?)
• Quantifiers and approximation
• Title not available (Why is that?)
• On Bounded Queries and Approximation

This page was built for publication: Structure in approximation classes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6085751)