2 papers
cs.CC2026
Quiet Planting for -SAT, Multiple Solutions of Arbitrary Geometry
Ali Ahmadi, Kiarash Banihashem, Iman Gholami +2
Recent work on "quiet planting" in combinatorial optimization aims to generate instances with a hidden solution that is hard to recover, typically by making the planted distributio…
cs.DS2025
Prize-Collecting Forest with Submodular Penalties: Improved Approximation
Ali Ahmadi, Iman Gholami, MohammadTaghi Hajiaghayi +2
Constrained forest problems form a class of graph problems where specific connectivity requirements for certain cuts within the graph must be satisfied by selecting the minimum-cos…