On bounded occurrence constraint satisfaction
From MaRDI portal
Publication:1607037
DOI10.1016/S0020-0190(00)00032-6zbMath1014.68149WikidataQ56959043 ScholiaQ56959043MaRDI QIDQ1607037
Publication date: 25 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
68T20: Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.)
68W25: Approximation algorithms
Related Items
Cites Work
- Optimization, approximation, and complexity classes
- Approximation algorithms for combinatorial problems
- A threshold of ln n for approximating set cover
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item