Apr 30, 2012 · View a PDF of the paper titled A note on: No need to choose: How to get both a PTAS and Sublinear Query Complexity, by Nir Ailon and Zohar ...

Apr 30, 2012 · We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on tournaments. A simple weighted ...

We discuss two particular problems for which (a) it has already been shown that sublinear querying is sufficient for obtaining a (1 + e)-approximation using ...

A note on: No need to choose: How to get both a PTAS and Sublinear Query Complexity. April 2012. Nir Ailon; [...] Zohar S. Karnin. We revisit ...

Jul 4, 2018 · We study sublinear algorithms for two fundamental ... A note on: No need to choose: How to get both a ptas and sublinear query complexity.

A note on: No need to choose: How to get both a PTAS and Sublinear Query Complexity · pdf icon · hmtl icon · Nir Ailon, Zohar Shay Karnin. 2012 (modified: 06 ...

Nir Ailon and Zohar Karnin. A note on: No need to choose: How to get both a ptas and sublinear query complexity. arXiv preprint arXiv:1204.6588, 2012.

A note on: No need to choose: How to get both a PTAS and sublinear query complexity. CoRR, abs/1204.6588, 2012. Ailon, Nir, Charikar, Moses, and Newman ...

A note on: No need to choose: How to get both a ptas and sublinear query complexity. arXiv preprint arXiv:1204.6588, 2012. 6. Noga Alon, W Fernandez De La ...

A note on: No need to choose: How to get both a ptas and sublinear query complexity. arXiv preprint arXiv:1204.6588, 2012. [6] Noga Alon, W Fernandez De La ...