An Improved Analysis for a Greedy Remote-Clique Algorithm Using Factor-Revealing LPs

By Benjamin E. Birnbaum, Kenneth J. Goldman. 2006

54 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications, Industrial and Manufacturing Engineering, Algorithms & Complexity

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Subhro Roy
2. Hannaneh Hajishirzi
3. Rik Koncel-Kedziorski
4. Nate Kushman

In Computer Networks and Communications

1. Nate Kushman
2. Hannaneh Hajishirzi

In Industrial and Manufacturing Engineering

1. Hannaneh Hajishirzi

Citations in the corpus

• MAWPS: A Math Word Problem Repository (2016, methodology): “As a result, we resort to a greedy strategy which gives an approximation ratio of 2 (Birnbaum and Goldman, 2007).”