Document Open Access Logo

Streaming Approximation Resistance of Every Ordering CSP

Authors Noah Singer , Madhu Sudan, Santhoshini Velusamy



PDF
Thumbnail PDF

File

LIPIcs.APPROX-RANDOM.2021.17.pdf
  • Filesize: 0.94 MB
  • 19 pages

Document Identifiers

Author Details

Noah Singer
  • Harvard College, Cambridge, MA, USA
Madhu Sudan
  • School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA
Santhoshini Velusamy
  • School of Engineering and Applied Sciences, Harvard University, Cambridge, MA, USA

Cite AsGet BibTex

Noah Singer, Madhu Sudan, and Santhoshini Velusamy. Streaming Approximation Resistance of Every Ordering CSP. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 207, pp. 17:1-17:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2021.17

Abstract

An ordering constraint satisfaction problem (OCSP) is given by a positive integer k and a constraint predicate Π mapping permutations on {1,…,k} to {0,1}. Given an instance of OCSP(Π) on n variables and m constraints, the goal is to find an ordering of the n variables that maximizes the number of constraints that are satisfied, where a constraint specifies a sequence of k distinct variables and the constraint is satisfied by an ordering on the n variables if the ordering induced on the k variables in the constraint satisfies Π. Ordering constraint satisfaction problems capture natural problems including "Maximum acyclic subgraph (MAS)" and "Betweenness". In this work we consider the task of approximating the maximum number of satisfiable constraints in the (single-pass) streaming setting, where an instance is presented as a stream of constraints. We show that for every Π, OCSP(Π) is approximation-resistant to o(n)-space streaming algorithms, i.e., algorithms using o(n) space cannot distinguish streams where almost every constraint is satisfiable from streams where no ordering beats the random ordering by a noticeable amount. This space bound is tight up to polylogarithmic factors. In the case of MAS our result shows that for every ε > 0, MAS is not 1/2+ε-approximable in o(n) space. The previous best inapproximability result only ruled out a 3/4-approximation in o(√ n) space. Our results build on recent works of Chou, Golovnev, Sudan, Velingker, and Velusamy who show tight, linear-space inapproximability results for a broad class of (non-ordering) constraint satisfaction problems (CSPs) over arbitrary (finite) alphabets. Our results are obtained by building a family of appropriate CSPs (one for every q) from any given OCSP, and applying their work to this family of CSPs. To convert the resulting hardness results for CSPs back to our OCSP, we show that the hard instances from this earlier work have the following "small-set expansion" property: If the CSP instance is viewed as a hypergraph in the natural way, then for every partition of the hypergraph into small blocks most of the hyperedges are incident on vertices from distinct blocks. By exploiting this combinatorial property, in combination with the hardness results of the resulting families of CSPs, we give optimal inapproximability results for all OCSPs.

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Approximation algorithms
  • Theory of computation → Streaming, sublinear and near linear time algorithms
  • Theory of computation → Discrete optimization
Keywords
  • Streaming approximations
  • approximation resistance
  • constraint satisfaction problems
  • ordering constraint satisfaction problems

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads

References

  1. Per Austrin, Rajsekar Manokaran, and Cenny Wenner. On the NP-hardness of approximating ordering-constraint satisfaction problems. Theory of Computing, 11:257-283, 2015. Conference version in APPROX 2013. URL: https://doi.org/10.4086/toc.2015.v011a010.
  2. Amey Bhangale and Subhash Khot. UG-Hardness to NP-Hardness by Losing Half. In 34th Computational Complexity Conference (CCC 2019, New Brunswick, New Jersey, USA, August 18-20, 2019), volume 137 of LIPIcs. Schloss Dagstuhl emdash Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.CCC.2019.3.
  3. Amit Chakrabarti, Prantar Ghosh, Andrew McGregor, and Sofya Vorotnikova. Vertex ordering problems in directed graph streams. In Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2020, Salt Lake City, Utah, USA, January 5-9, 2020), pages 1786-1802. Society for Industrial and Applied Mathematics, 2020. URL: https://doi.org/10.5555/3381089.3381198.
  4. Benny Chor and Madhu Sudan. A geometric approach to betweenness. SIAM Journal on Discrete Mathematics, 11(4):511-523, 1998. Conference version in Algorithms, ESA 1995. URL: https://doi.org/10.1137/S0895480195296221.
  5. Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, Ameya Velingker, and Santhoshini Velusamy. Linear Space Streaming Lower Bounds for Approximating CSPs, June 2021. URL: http://arxiv.org/abs/2106.13078.
  6. Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, and Santhoshini Velusamy. Approximability of all Boolean CSPs in the dynamic streaming setting, 2021. URL: http://arxiv.org/abs/2102.12351.
  7. Chi-Ning Chou, Alexander Golovnev, Madhu Sudan, and Santhoshini Velusamy. Approximability of all finite CSPs in the dynamic streaming setting, June 2021. URL: http://arxiv.org/abs/2105.01161.
  8. Chi-Ning Chou, Alexander Golovnev, and Santhoshini Velusamy. Optimal Streaming Approximations for all Boolean Max-2CSPs and Max-kSAT. In 2020 IEEE 61st Annual Symposium on Foundations of Computer Science (FOCS 2020, November 16-19, 2020), pages 330-341. IEEE Computer Society, 2020. URL: https://doi.org/10.1109/FOCS46700.2020.00039.
  9. Dmitry Gavinsky, Julia Kempe, Iordanis Kerenidis, Ran Raz, and Ronald de Wolf. Exponential separation for one-way quantum communication complexity, with applications to cryptography. SIAM Journal on Computing, 38(5):1695-1708, 2008. Conference version in STOC 2007. URL: https://doi.org/10.1137/070706550.
  10. Venkatesan Guruswami, Johan Håstad, Rajsekar Manokaran, Prasad Raghavendra, and Moses Charikar. Beating the Random Ordering is Hard: Every ordering CSP is approximation resistant. SIAM Journal on Computing, 40(3):878-914, 2011. Conference version in FOCS 2008. URL: https://doi.org/10.1137/090756144.
  11. Venkatesan Guruswami and Runzhou Tao. Streaming Hardness of Unique Games. In Dimitris Achlioptas and László A. Végh, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2019, Cambridge, MA, USA, September 20-22, 2019), volume 145 of LIPIcs, pages 5:1-5:12. Schloss Dagstuhl emdash Leibniz-Zentrum für Informatik, 2019. URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2019.5.
  12. Venkatesan Guruswami, Ameya Velingker, and Santhoshini Velusamy. Streaming Complexity of Approximating Max 2CSP and Max Acyclic Subgraph. In Klaus Jansen, José D. P. Rolim, David Williamson, and Santosh S. Vempala, editors, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2017, Berkeley, CA, USA, August 16-18, 2017), volume 81 of LIPIcs, pages 8:1-8:19. Schloss Dagstuhl emdash Leibniz-Zentrum für Informatik, 2017. URL: https://doi.org/10.4230/LIPIcs.APPROX-RANDOM.2017.8.
  13. Johan Håstad. Some optimal inapproximability results. Journal of the ACM, 48(4):798-859, 2001. URL: https://doi.org/10.1145/502090.502098.
  14. Michael Kapralov, Sanjeev Khanna, and Madhu Sudan. Streaming lower bounds for approximating MAX-CUT. In Proceedings of the 26th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2015, San Diego, California, USA, January 4-6, 2015), pages 1263-1282. Society for Industrial and Applied Mathematics, January 2015. URL: https://doi.org/10.1137/1.9781611973730.84.
  15. Michael Kapralov, Sanjeev Khanna, Madhu Sudan, and Ameya Velingker. (1 + ω(1))-approximation to MAX-CUT requires linear space. In Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2017, Barcelona, Spain, January 16-19, 2017), pages 1703-1722. Society for Industrial and Applied Mathematics, January 2017. URL: https://doi.org/10.5555/3039686.3039798.
  16. Michael Kapralov and Dmitry Krachun. An optimal space lower bound for approximating MAX-CUT. In Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing (STOC 2019, Phoenix, AZ, USA, June 23-26, 2019), pages 277-288. Association for Computing Machinery, June 2019. URL: https://doi.org/10.1145/3313276.3316364.
  17. Richard M. Karp. Reducibility among Combinatorial Problems. In R.E. Miller, J.W. Thatcher, and J.D. Bohlinger, editors, The IBM Research Symposia Series, pages 85-103. Springer, 1972. URL: https://doi.org/10.1007/978-1-4684-2001-2_9.
  18. Subhash Khot. On the power of unique 2-prover 1-round games. In Proceedings of the 34th Annual ACM Symposium on Theory of Computing (STOC 2002, Québec, Canada, May 19-21, 2002), pages 767-775. Association for Computing Machinery, 2002. URL: https://doi.org/10.1145/509907.510017.
  19. Dmitry Kogan and Robert Krauthgamer. Sketching cuts in graphs and hypergraphs. In Proceedings of the 6th Annual Conference on Innovations in Theoretical Computer Science (ITCS 2015, Rehovot, Israel, January 11-13, 2015), pages 367-376. Association for Computing Machinery, 2015. URL: https://doi.org/10.1145/2688073.2688093.
  20. Alantha Newman. Approximating the Maximum Acyclic Subgraph. Masters Thesis, Massachusetts Institute of Technology, 2000. Google Scholar
  21. Jaroslav Opatrny. Total Ordering Problem. SIAM Journal on Computing, 8(1):111-114, 1979. URL: https://doi.org/10.1137/0208008.
  22. Noah Singer, Madhu Sudan, and Santhoshini Velusamy. Streaming approximation resistance of every ordering CSP, 2021. Full version of this paper. URL: http://arxiv.org/abs/2105.01782.
  23. Noah Singer, Madhu Sudan, and Santhoshini Velusamy. Streaming approximation resistance of every ordering CSP, May 2021. Original version of this paper; proved only o(√n) space lower bounds. URL: http://arxiv.org/abs/2105.01782v1.
  24. Elad Verbin and Wei Yu. The streaming complexity of cycle counting, sorting by reversals, and other problems. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011, San Francisco, California, USA, January 23-25, 2011), pages 11-25. Society for Industrial and Applied Mathematics, 2011. URL: https://doi.org/10.5555/2133036.2133038.
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail