Structure in approximation classes

DOI10.1007/bfb0030875zbMath1527.68085OpenAlexW1516959859MaRDI QIDQ6085751

Viggo Kann, Riccardo Silvestri, Pierluigi 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

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

Cites Work

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

This page was built for publication: Structure in approximation classes