Advertisement

The approximability of problems complete for P

  • Maria Serna
  • Paul Spirakis
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 401)

Abstract

We examine here the existence of approximations in NC of P-complete problems. We show that many P-complete problems (such as UNIT, PATH, circuit value etc.) cannot have an approximating solution in NC for any value of the absolute performance ratio R of the approximation, unless P=NC. On the other hand, we exhibit of a purely combinatorial problem (the High Connectivity subgraph problem) whose behaviour with respect to fast parallel approximations is of a threshold type. This dichotomy in the behaviour of approximations of P-complete problems is for the first time revealed and we show how the tools of log-space reductions can be used to make inferences about the best possible performance of approximations of problems that are hard to parallelize.

Keywords

Node Pair Optimization Version Vertex Connectivity Gate Input Linear Reduction 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [Jones, Laasser, 77]
    "Complete Problems for Deterministic Polynomial Time" by N. Jones and W. Laaser, Theor. Computer Science 3 (1977), 105–117.CrossRefGoogle Scholar
  2. [Papadimitriou, Yannakakis, 88]
    "Optimization, Approximation and Complexity classes", by C.H. Papadimitriou and M. Yannakakis, STOC 1988.Google Scholar
  3. [Anderson, Mayr, 86]
    "Approximating P-Complete Problems", by R. Anderson and E. Mayr, TR Stanford Univ., 1986.Google Scholar
  4. [Warmuth, 86]
    "Parallel Approximation Algorithms for one-Dimensional Bin Packing", by Warmuth, TR Univ. of California at Santa Cruz, 1986.Google Scholar
  5. [Kirousis, Spirakis, 88]
    "Probabilistic log-space reductions and problems probabilistically hard for P", by L. Kirousis and P. Spirakis, SWAT 88.Google Scholar
  6. [Ansiello, D'Atri, Protasi, 77]
    "On the Structure of Combinatorial Problems and Structure Preserving Reductions", by Ansiello, D'Atri and Protasi, Proc. 4th ICALP 45–57, 1977.Google Scholar
  7. [Ansiello, D'Atri, Protasi, 80]
    "Structure Preserving Reductions among Convex Optimization Problems", by Ansiello, D'Atri and Protasi, J. Comp. Sys. Sc. 21, 136–153, 1980.CrossRefGoogle Scholar
  8. [Ansiello, Marchetti-Spaccamela, Protasi, 80]
    "Toward a Unified Approach for the Classification of NP-Complete Optimization Problems", by Ansiello, Marchetti-Spaccamela and Protasi, 12, 83–96, 1980.Google Scholar
  9. [Garey, Johnson, 79]
    "Computers and Intractability — A Guide to the Theory of NP-Completeness", by M. Garey and D. Johnson, Freeman, 1979.Google Scholar
  10. [Paz, Moran, 81]
    "Non Deterministic Polynomial Optimization Problems and their Approximation", by A. Paz and S. Moran, Theor. Computer Science, 15, 251–277, 1981.CrossRefGoogle Scholar
  11. [Matula, 78]
    "k-blocks and ultrablocks in graphs", by D. Matula, J. of Combinatorial Theory, 24, 1978, pp. 1–13.CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1989

Authors and Affiliations

  • Maria Serna
    • 1
  • Paul Spirakis
    • 2
  1. 1.Polytechnic University of CataloniaBarcelonaSpain
  2. 2.Computer Technology InstitutePatras UniversityGreece

Personalised recommendations