# 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

#### Topics from this paper.

#### Citations

##### Publications citing this paper.

SHOWING 1-3 OF 3 CITATIONS

## Correlation Clustering in Data Streams

VIEW 5 EXCERPTS

CITES METHODS

HIGHLY INFLUENCED

## D S ] 2 0 Fe b 20 18 Sublinear Algorithms for MAXCUT and Correlation Clustering ∗

VIEW 1 EXCERPT

CITES BACKGROUND

## Sublinear Algorithms for MAXCUT and Correlation Clustering

VIEW 1 EXCERPT

CITES BACKGROUND

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 11 REFERENCES

## Ranking Tournaments

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