Component-based software engineering attempts to address the ever increasing demand for new software applications by enabling a compositional approach to software construction in ...
We show that the Multicut, Sparsest-Cut, and Min-2CNF≡ Deletion problems are NP-hard to approximate within every constant factor, assuming the Unique Games Conjecture of Khot [S...
Shuchi Chawla, Robert Krauthgamer, Ravi Kumar, Yuv...
We propose a model called priority branching trees (pBT ) for backtracking and dynamic programming algorithms. Our model generalizes both the priority model of Borodin, Nielson an...
Michael Alekhnovich, Allan Borodin, Joshua Buresh-...