• Mathematics, Computer Science
  • Published in ArXiv 2012

A note on: No need to choose: How to get both a PTAS and Sublinear Query Complexity

@article{Ailon2012ANO,
  title={A note on: No need to choose: How to get both a PTAS and Sublinear Query Complexity},
  author={Nir Ailon and Zohar S. Karnin},
  journal={ArXiv},
  year={2012},
  volume={abs/1204.6588}
}
We revisit various PTAS's (Polynomial Time Approximation Schemes) for minimization versions of dense problems, and show that they can be performed with sublinear query complexity. This means that not only do we obtain a (1+eps)-approximation to the NP-Hard problems in polynomial time, but also avoid reading the entire input. This setting is particularly advantageous when the price of reading parts of the input is high, as is the case, for examples, where humans provide the input. Trading off… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
SHOWING 1-10 OF 11 REFERENCES

Ranking Tournaments

  • Noga Alon
  • Mathematics, Computer Science
  • SIAM J. Discrete Math.
  • 2006
VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Correlation clustering with a fixed number of clusters

VIEW 9 EXCERPTS
HIGHLY INFLUENTIAL

A new rounding procedure for the assignment problem with applications to dense graph arrangement problems

VIEW 7 EXCERPTS
HIGHLY INFLUENTIAL

How to rank with few errors

VIEW 4 EXCERPTS
HIGHLY INFLUENTIAL

Maximizing quadratic programs: extending Grothendieck's inequality

VIEW 1 EXCERPT

Correlation clustering