Knapsack Problem
A Simple, Greedy Approximation Algorithm for MAX SAT David P. Williamson Joint work with Matthias Poloczek (Frankfurt, Cornell) and Anke van Zuylen (William.
Ben Livshits and Weidong Cui Microsoft Research Redmond, WA.
Knowing a Good HOG Filter When You See It: Efficient Selection of Filters for Detection Ejaz Ahmed 1, Gregory Shakhnarovich 2, and Subhransu Maji 3 1 University.
Approximating Optimal Binary Decision Trees Brent Heeringa [email protected] (joint work with Micah Adler) 18 November 2005.
An O(log(n))-Approximation for Decision Trees Brent Heeringa [email protected] (joint work with Micah Adler) 11 March 2005.
International Spotlight
CS5234 Combinatorial and Graph Algorithms
