Approximating minimum keys and optimal substructure screens

DOI10.1007/3-540-61332-3_163zbMath1529.68321MaRDI QIDQ6184674

Tatsuya Akutsu, Feng Bao

Publication date: 29 January 2024

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

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• Unnamed Item
• Optimization, approximation, and complexity classes
• Approximation algorithms for combinatorial problems
• On the ratio of optimal integral and fractional covers
• Candidate keys for relations
• Logical definability of NP optimization problems
• On the Structure of Armstrong Relations for Functional Dependencies
• On the hardness of approximating minimization problems
• Polynomially bounded minimization problems which are hard to approximate
• On the approximation of shortest common supersequences and longest common subsequences

This page was built for publication: Approximating minimum keys and optimal substructure screens