scientific article; zbMATH DE number 1301970

zbMATH Open0944.90103MaRDI QIDQ4247205FDOQ4247205

Authors: Gunnar Andersson, Lars Engebretsen 

Publication date: 26 September 2000

Title of this publication is not available (Why is that?)

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

zbMATH Keywords

sampling methodsdense instances of optimization problemsrandomized polynomial time approximation scheme

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59)

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
• Title not available (Why is that?)

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)