Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
From MaRDI portal
Publication:4417004
DOI10.1002/rsa.10072zbMath1023.68093MaRDI QIDQ4417004
Wenceslas Fernandez de la Vega, Cristina Bazgan, Marek Karpinski
Publication date: 6 August 2003
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.10072
approximation algorithms; dense instances; polynomial time approximation schemes; nearest codeword problem; approximation ratios; hypergraph sampling; minimum constraint satisfaction
90C27: Combinatorial optimization
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68W20: Randomized algorithms
Related Items
Cites Work