New local search approximation techniques for maximum generalized satisfiability problems-Reference-Cited by-同舟云学术

New local search approximation techniques for maximum generalized satisfiability problems

Published:1994 Issue: Volume: Page:40-53
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Alimonti Paola

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-57811-0_5.pdf

Reference13 articles.

1. G. Ausiello, A. Marchetti-Spaccamela, M. Protasi, Toward a Unified Approach for the Classification of NP-Complete Optimization Problems, Th. Comp. Sci.,12,(1980), 83–96.

2. G.Ausiello, M. Protasi, NP Optimization Problems and Local Optima, Technical Report, Esprit Bra Alcom II, 1992.

3. D. Bruschi, D. Joseph, and P. Young, A Structural Overview of NP Opimization Problems, Rapporto Interno n. 75/90, Dip. di Scienze dell'Informazione, Univ. degli Studi di Milano, 1990.

4. S. A. Cook, The Complexity of Theorem Proving Procedures, Proc. 3th. Annual ACM Symp. on Theory of Computing, (1971), 151–158.

5. M. Garey, and D. Johnson, Computers and Intractability: a Guide to the Theory of NP-Comleteness, Freeman, San Francisco (1979).

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

1. Approximation for maximizing monotone non-decreasing set functions with a greedy method;Journal of Combinatorial Optimization;2014-01-30

2. Covering Games: Approximation through Non-cooperation;Lecture Notes in Computer Science;2009

3. A Survey of Approximation Results for Local Search Algorithms;Lecture Notes in Computer Science;2006

4. BIBLIOGRAPHY;Stochastic Local Search;2005

5. Non-oblivious local search for graph and hypergraph coloring problems;Graph-Theoretic Concepts in Computer Science;1995