Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems-Reference-Cited by-同舟云学术

Polynomial Time Approximation Schemes for Dense Instances of NP-Hard Problems

Published:1999-02 Issue:1 Volume:58 Page:193-210
ISSN:0022-0000
Container-title:Journal of Computer and System Sciences
language:en
Short-container-title:Journal of Computer and System Sciences

Author:

Arora Sanjeev,Karger David,Karpinski Marek

Publisher

Elsevier BV

Subject

Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science

Reference47 articles.

1. A new rounding procedure for the assignment problem with applications to dense graph arrangement problems;Arora,1996

2. N. Alon, A. Frieze, D. Welsh, Polynomial time randomized approximation schemes for the tutte polynomial of dense graphs, Proceedings of the 35th Annual Symposium on the Foundations of Computer Science [IEE94], 24, 35

3. S. Arora, C. Lund, R. Motwani, M. Sudan, M. Szegedy, Proof verification and hardness of approximation problems, Proceedings of the 33rd Annual Symposium on the Foundations of Computer Science [IEE92], 14, 23

4. Probabilistic checking of proofs: A new characterization of NP;Arora;Assoc. Comput. Mach.,1998

5. Graph bisection algorithms with good average case behavior;Bui,1984

Cited by 122 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Low-depth Clifford circuits approximately solve MaxCut;Physical Review Research;2024-06-20

2. Identifying Best Goalkeepers Problem is a NP-Hard?;Smart Innovation, Systems and Technologies;2024

3. Pliability and Approximating Max-CSPs;Journal of the ACM;2023-11-30

4. Numerical Evidence for Exponential Speed-Up of QAOA over Unstructured Search for Approximate Constrained Optimization;2023 IEEE International Conference on Quantum Computing and Engineering (QCE);2023-09-17

5. Quantum Goemans-Williamson Algorithm with the Hadamard Test and Approximate Amplitude Constraints;Quantum;2023-07-12