Article

Free access

Polynomial time approximation schemes for dense instances of NP-hard problems

Authors:

Sanjeev Arora,

David Karger,

Marek KarpinskiAuthors Info & Claims

STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

Pages 284 - 293

https://doi.org/10.1145/225058.225140

Published: 29 May 1995 Publication History

PDF eReader

References

[1]

N. Alon, A. Frieze, and D. Welsh. Poly-nomial time randomized approximation schemes for the tutte polynomial of dense graphs. In Proc. 35 'h FOCS, pages 24- 35. IEEE, IEEE Computer Society Press, November 1994.

Google Scholar

[2]

S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In Proc. 33rd FOG'S, pages 14-23. IEEE, October 1992.

Digital Library

Google Scholar

[3]

S. Arora and S. Safra. Probabilistic check-ing of proofs: A new characterization of NP. In Proc. 33rd FOG'S, pages 2-13, IEEE, 1992.

Google Scholar

[4]

T. Bui, S. Chaudhuri, T. Leighton, and M. Sipser. Graph bisection algorithms with good average case behavior. In Proc. 25th FOCS, pages 181-192. IEEE, 1984.

Google Scholar

[5]

M. Bellare, O. Goldreich, and S. Gold-wasser. Randomness in interactive proofs. Computational Compleztty, 3:319- 354, 1993. Abstract in FOCS 1990.

Digital Library

Google Scholar

[6]

R.B. Boppana and M.M. Halldorsson. Ap-proximating maximum independent sets by excluding subgraphs. BIT, 32:180-196, 1992.

Digital Library

Google Scholar

[7]

M. Bellare and J. Rompel. Randomness-efficient oblivious sampling. In Proc. 35th FOCS, pages 276-287. IEEE, 1994.

Digital Library

Google Scholar

[8]

E. Dahlhaus, D.S. Johnson, C.H. Pa-padimitriou, P.D. Seymour, and M. Yan-nakakis. The complexity of multiway cuts. In Proc. 24'h ACM STOC, pages 241-251. ACM Press, May 1992.

Digital Library

Google Scholar

[9]

W.F. de la Vega. MAXCUT has a ran-domized approximation scheme in dense graphs. manuscript, October 1994.

Google Scholar

[10]

K. Edwards. The complexity of colouring problemson dense graphs. Theoretical Computer Sctence, 43:337-343, 1986.

Digital Library

Google Scholar

[11]

U. Feige and M.X. Goemans, Approxi-mating the value of 2-Prover proof sys-tems, with applications to MAX-2 SAT and MAX-DICUT. In Proc. IS7'CS95, pages 182-189.

Digital Library

Google Scholar

[12]

J. Feige, S. Goldwasser, L. LOVASZ, S. Safra, and M. Szegedy. Approximat-ing clique is almost NP-complete. In Proc. 32nd FOCS, pages 2-12, IEEE, 1991.

Digital Library

Google Scholar

[13]

D. Gillman. A chernoff bound for random walks on expanders. In Proc. 34th FOCS, pages 680-691. IEEE, November 1993.

Digital Library

Google Scholar

[14]

M.X. Goemans ancl D.P. Williamson. .878- approximation algorithms for MAX CUT and MAX 2SAT. In Proc. 26th STOC, pages 422-431. ACM Press, May 1994.

Digital Library

Google Scholar

[15]

0. H. Ibarra and C. E. Kim. Fast ap-proximation algorithms for the knapsack and sum of subsets problems. JA CM, 22(4):463-468, 1975.

Digital Library

Google Scholar

[16]

M. .Jerrum and A. Sinclair. Approximating the permanent. SIAM 1. Comput., 18(6), 1989.

Digital Library

Google Scholar

[17]

M. Jerrum and G. B. Sorkin. Simulated annealing for graph bisection. In Proc. 34th FOCS, pages 94-103. IEEE, Novem-ber 1993.

Digital Library

Google Scholar

[18]

N. Karmaker and R.M. Karp. An effi-cient approximation scheme for the one-dimensional bin-packing problem. In Proc. 23r~ FOCS, pages 312-320. IEEE, 1982.

Google Scholar

[19]

G. Kortsarz and D. Peleg. On choosing a dense subgraph. In Proc. 34th FOCS, pages 692-701. IEEE, November 1993.

Digital Library

Google Scholar

[20]

E. Koutsoupias and C.H. Papadimitriou. On the greedy heuristic for satisfiability. IPL, 43 pages 53-55, 1992.

Digital Library

Google Scholar

[21]

T. Leighton and S. Rae. An approxi-mate max-flow rein-cut theorem for uni-form multicommodity flow problems with applications to approximation algorithms. In Proc. 29th FOG'S, pages 422-431. IEEE, October 1988.

Google Scholar

[22]

C. Lund and M. Yannakakis. hardness of approximating minimization problems. In Proc. 25th STOC, pages 286-293. ACM, May 1993.

Digital Library

Google Scholar

[23]

C. H. Papadimitriou. Compuiattonal Complexity. Addison-Wesley, 1994.

Google Scholar

[24]

C .H. Papadimitriou and M. Yannakakis. Optimization, approximation and com-plexity classes. JCSS, 43:425-440, 1991. Preliminary Version in Proc. ACM STOC, 1988.

Digital Library

Google Scholar

[25]

L. P6sa. Hamiltonian circuits in random graphs. Dzscreie Mathemat~cs, 14:359-364, 1976.

Digital Library

Google Scholar

[26]

P. Raghavan. Probabilistic construc-tion of deterministic algorithms: Approx-imate packing integer programs. .JCSS, 37(2):130-43, October 1988.

Digital Library

Google Scholar

[27]

P. Raghavan and C. Thompson. Random-ized Rounding: a technique for provably good algorithms and algorithmic proofs Combtnator~ca, 7:365-374, 1987.

Digital Library

Google Scholar

[28]

D. Shmoys. Computing near-optimal solu-tions to combinatorial optimization prob-lems. To appear in Dimacs Series m Dw-crete Math and Theoretical Computer Sct-ence, 1994.

Google Scholar

[29]

M. Yannakakis. On the approximation of maximum satisfiability. In Proc. 3'_d SODA, pages 1-9. ACM-SIAM, January 1992.

Crossref

Google Scholar

Cited By

View all

Guruswami VHsieh JKothari PManohar P(2023)Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00026(307-327)Online publication date: 6-Nov-2023
https://doi.org/10.1109/FOCS57990.2023.00026
Chatziafratis VMakarychev K(2023)Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00024(253-284)Online publication date: 6-Nov-2023
https://doi.org/10.1109/FOCS57990.2023.00024
Guruswami VKothari PManohar PLeonardi SGupta A(2022)Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than randomProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3519955(678-689)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3519955
Show More Cited By

Index Terms

Polynomial time approximation schemes for dense instances of NP-hard problems
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Graph algorithms
  2. Mathematical analysis
2. Theory of computation

Recommendations

Polynomial time approximation schemes and parameterized complexity

In this paper, we study the relationship between the approximability and the parameterized complexity of NP optimization problems. We introduce a notion of polynomial fixed-parameter tractability and prove that, under a very general constraint, an NP ...
Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?
ICALP '00: Proceedings of the 27th International Colloquium on Automata, Languages and Programming

In 1991 Feige, Goldwasser, Lovász, Safra and Szegedy found a connection between the approximability of Max-Clique and the area of multiprover interactive proofs. What first seemed like an isolated result have developed into an entire area of research.

...
Parameterized complexity and polynomial-time approximation schemes

Comments

Information & Contributors

Information

Published In

STOC '95: Proceedings of the twenty-seventh annual ACM symposium on Theory of computing

May 1995

776 pages

ISBN:0897917189

DOI:10.1145/225058

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 29 May 1995

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC95

Sponsor:

SIGACT

STOC95: Symposium on Theory of Computing

May 29 - June 1, 1995

Nevada, Las Vegas, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

125
Total Citations
View Citations
1,509
Total Downloads

Downloads (Last 12 months)185
Downloads (Last 6 weeks)21

Reflects downloads up to 12 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Guruswami VHsieh JKothari PManohar P(2023)Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00026(307-327)Online publication date: 6-Nov-2023
https://doi.org/10.1109/FOCS57990.2023.00026
Chatziafratis VMakarychev K(2023)Triplet Reconstruction and all other Phylogenetic CSPs are Approximation Resistant2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS57990.2023.00024(253-284)Online publication date: 6-Nov-2023
https://doi.org/10.1109/FOCS57990.2023.00024
Guruswami VKothari PManohar PLeonardi SGupta A(2022)Algorithms and certificates for Boolean CSP refutation: smoothed is no harder than randomProceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing10.1145/3519935.3519955(678-689)Online publication date: 9-Jun-2022
https://dl.acm.org/doi/10.1145/3519935.3519955
Takhanov R(2022)The algebraic structure of the densification and the sparsification tasks for CSPsConstraints10.1007/s10601-022-09340-128:1(13-44)Online publication date: 8-Dec-2022
https://doi.org/10.1007/s10601-022-09340-1
Galimberti EBonchi FGullo FLanciano T(2020)Core Decomposition in Multilayer NetworksACM Transactions on Knowledge Discovery from Data10.1145/336987214:1(1-40)Online publication date: 3-Feb-2020
https://dl.acm.org/doi/10.1145/3369872
Zhou RLi ZWu C(2019)An Efficient Online Placement Scheme for Cloud Container ClustersIEEE Journal on Selected Areas in Communications10.1109/JSAC.2019.290674537:5(1046-1058)Online publication date: May-2019
https://doi.org/10.1109/JSAC.2019.2906745
Zhou R(2018)An Online Placement Scheme for VNF Chains in Geo-Distributed Clouds2018 IEEE/ACM 26th International Symposium on Quality of Service (IWQoS)10.1109/IWQoS.2018.8624140(1-2)Online publication date: Jun-2018
https://doi.org/10.1109/IWQoS.2018.8624140
Buchbinder NSchwartz RWeizman BKlein P(2017)Simplex transformations and the multiway cut problemProceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3039686.3039844(2400-2410)Online publication date: 16-Jan-2017
https://dl.acm.org/doi/10.5555/3039686.3039844
Bremner MMontanaro AShepherd D(2017)Achieving quantum supremacy with sparse and noisy commuting quantum computationsQuantum10.22331/q-2017-04-25-81(8)Online publication date: 25-Apr-2017
https://doi.org/10.22331/q-2017-04-25-8
LeAnh TTran NLee SHuh EHan ZHong C(2017)Distributed Power and Channel Allocation for Cognitive Femtocell Network Using a Coalitional Game in Partition-Form ApproachIEEE Transactions on Vehicular Technology10.1109/TVT.2016.253675966:4(3475-3490)Online publication date: Apr-2017
https://doi.org/10.1109/TVT.2016.2536759
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Polynomial time approximation schemes and parameterized complexity

Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?

Parameterized complexity and polynomial-time approximation schemes

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Polynomial time approximation schemes and parameterized complexity

Which NP-Hard Optimization Problems Admit Non-trivial Efficient Approximation Algorithms?

Parameterized complexity and polynomial-time approximation schemes

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations