Implications of Forbidden Structures for Extremal Algorithmic Problems

@article{Huang1985ImplicationsOF,
  title={Implications of Forbidden Structures for Extremal Algorithmic Problems},
  author={Ming-Deh A. Huang and Karl J. Lieberherr},
  journal={Theor. Comput. Sci.},
  year={1985},
  volume={40},
  pages={195-210}
}
We develop and analyze P-optimal approximation algorithms for various generalized satisfiability problems and determine the corresponding P-optimal thresholds. The most novel aspect of the paper is that we develop new P-optimal algorithms for restricted generalized satisfiability problems which are defined by forbidden subformulas. All our algorithms run in linear time on a RAM. 1. Generalized satisflability We continue the study of algorithmic extremal problems related to the generalized… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 12 references

On even subgraphs of graphs

  • P. ErdSs
  • Mat Lapok 18 (3, 4)
  • 1967
Highly Influential
4 Excerpts

Edge - deletion problems , SIAMJ

  • ICJ. Lieberherr, E. Specker
  • Algorithms
  • 1982

Lieberherr , Algorithmic extremal problems in combinatorial optimization , 1

  • J. IC
  • Conf . on Information Sciences and Systems
  • 1982

On P-optimal approximation algorithms

  • K. J. Lieberherr, J. Scranton
  • Pro~ 16th Ann. Conf. on Information Sciences and…
  • 1982
1 Excerpt

Edge-deletion problems

  • M. Yarmakakis
  • SIAMJ. CompuL 10 (2)
  • 1981

The complexity of satisfiability problems

  • T. Schaefer
  • Proc. lOth Ann. ACM Syrup. on Theory of Computing
  • 1978
2 Excerpts

Similar Papers

Loading similar papers…