General techniques for combinatorial approximation

MaRDI QIDQ4635994zbMATH OpenFDO

Authors Sartaj Sahni

Publication date 23 April 2018

zbMATH Keywords

combinatorial approximationfully polynomial time approximation schemesheuristic

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Analysis of algorithms and problem complexity (68Q25) Approximation algorithms (68W25) Analysis of algorithms (68W40) Boolean programming (90C09) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• scientific article; zbMATH DE number 3873084
• scientific article; zbMATH DE number 988191
• The design of approximation algorithms
• Geometric approximation algorithms
• Approximation algorithms for NP-hard problems.

Cited in

(1)

• Combinatorial principles concerning approximations of functions

This page was built for publication: General techniques for combinatorial approximation

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