Author:
Charikar Moses,Hajiaghayi MohammadTaghi,Karloff Howard
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference20 articles.
1. Aazami, A., Stilp, M.D.: Approximation algorithms and hardness for domination with propagation. In: The 9th International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX), pp. 1–15 (2007)
2. Arora, S., Babai, L., Stern, J., Sweedyk, Z.: The hardness of approximate optima in lattices, codes, and systems of linear equations. J. Comput. Syst. Sci. 54, 317–331 (1997)
3. Bhaskara, A., Charikar, M., Chlamtac, E., Feige, U., Vijayaraghavan, A.: Detecting high log-densities–an O(n 1/4) approximation for densest k-subgraph. In: Proceedings of the Forty-Second Annual ACM Symposium on Theory of Computing (STOC), pp. 201–210. ACM, New York (2010)
4. Bhattacharyya, A., Grigorescu, E., Jung, K., Raskhodnikova, S., Woodruff, D.P.: Transitive-closure spanners. In: SODA ’09, 20th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, pp. 932–941 (2009)
5. Breslau, L., Diakonikolas, I., Duffield, N., Gu, Y., Hajiaghayi, M., Johnson, D., Karloff, H., Resende, M.G.C., Sen, S.: Disjoint-path facility location: theory and practice. In: 2011 ALENEX proceedings, San Francisco, January 22, pp. 60–74. SIAM, Philadelphia (2011)
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Pliability and Approximating Max-CSPs;Journal of the ACM;2023-11-30
2. Sum-of-Squares Lower Bounds for Densest k-Subgraph;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Classifier Construction Under Budget Constraints;Proceedings of the 2022 International Conference on Management of Data;2022-06-10
4. A characterization of approximability for biased CSPs;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
5. Near-Optimal NP-Hardness of Approximating MAX k-CSPR;Theory of Computing;2022