scientific article; zbMATH DE number 1301970

MaRDI QIDQ4247205zbMATH OpenFDO

Authors Gunnar Andersson, Lars Engebretsen

Publication date 26 September 2000

zbMATH Keywords

sampling methodsdense instances of optimization problemsrandomized polynomial time approximation scheme

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• Polynomial time approximation schemes for some dense instances of NP-hard optimization problems
• Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
• scientific article; zbMATH DE number 1263204
• Polynomial time approximation schemes for dense instances of \( \mathcal{NP}\)-hard problems
• Pseudo-Boolean optimization

Cited in

(5)

• Greedy Sampling Using Nonlinear Optimization
• Random sampling and approximation of MAX-CSPs
• Alternative sampling strategy for a random optimization algorithm
• Property testers for dense constraint satisfaction programs on finite domains
• scientific article; zbMATH DE number 4168234 (Why is no real title available?)

This page was built for publication:

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