Searching for authors named "Sanjeev Arora" – sorted by Relevance.
49 documents found, showing 1 through 10.
Next 10 →
-
The Approximability of NP-hard Problems
- …The Approximability of NP-hard Problems Sanjeev Arora # Princeton University 1 Introduction Many…
- Cited by 9 (0 self) – Add To MetaCart
-
Around the PCP Theorem
- …Around the PCP Theorem Sanjeev Arora Princeton University Technical Report SOCS-97.2 School…
- Cited by 2 (0 self) – Add To MetaCart
-
Reductions, codes, PCPs, and inapproximability
- …Reductions, Codes, PCPs, and Inapproximability Sanjeev Arora Princeton University Abstract Many…
- Cited by 3 (0 self) – Add To MetaCart
-
Approximation schemes for NP-hard geometric optimization problems: A survey
- …Approximation schemes for NP-hard geometric optimization problems: A survey Sanjeev Arora…
- Cited by 20 (1 self) – Add To MetaCart
-
Approximation schemes for minimum latency problems
- … Approximation Schemes for Minimum Latency Problems Sanjeev Arora * Princeton University George…
- Cited by 26 (4 self) – Add To MetaCart
-
Approximation schemes for degree-restricted MST and red-blue separation problem
- … Approximation Schemes for Degree-restricted MST and Red-Blue Separation Problem Sanjeev Arora…
- Cited by 12 (1 self) – Add To MetaCart
-
Probabilistic checking of proofs: a new characterization of NP
- …Probabilistic Checking of Proofs: A New Characterization of NP SANJEEV ARORA Princeton University…
- Cited by 291 (27 self) – Add To MetaCart
-
Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems
- …Nearly Linear Time Approximation Schemes for Euclidean TSP and other Geometric Problems Sanjeev…
- Cited by 77 (4 self) – Add To MetaCart
-
Polynomial Time Approximation Schemes for Euclidean Traveling Salesman and other Geometric Problems
- … Sanjeev Arora Princeton University Association for Computing Machinery, Inc., 1515 Broadway, New York, NY…
- Cited by 225 (3 self) – Add To MetaCart
-
and Problem Complexity—Nonnumerical Algorithms and Problems General Terms
- …Unique Games on Expanding Constraint Graphs are Easy ABSTRACT Sanjeev Arora ∗ Princeton University…
- Add To MetaCart
Showing 1 through 10.
Next 10 →
