Log-approximable minimization problems on random inputs

DOI10.1007/BFB0022258MaRDI QIDQ4474841zbMATH OpenFDO

Authors A. Malmström

Publication date 21 July 2004

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

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

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Approximable minimization problems and optimal solutions on random inputs
• scientific article; zbMATH DE number 515727
• Quantifiers and approximation
• On the hardness of approximating minimization problems
• Approximation properties of NP minimization classes

Cited in

(1)

• Approximable minimization problems and optimal solutions on random inputs

This page was built for publication: Log-approximable minimization problems on random inputs

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