Some Prospects forEfficient Fixed Parameter Algorithms
Recent time has seen quite some progress in the development of exponential time algorithms for NP-hard problems, where the base of the exponential term is fairly small. These developments are also tightly related to the theory of fixed parameter tractability. In this incomplete survey, we explain some basic techniques in the design of efficient fixed parameter algorithms, discuss deficiencies of parameterized complexity theory, and try to point out some future research challenges. The focus of this paper is on the design of efficient algorithms and not on a structural theory of parameterized complexity. Moreover, our emphasis will be laid on two exemplifying issues: Vertex Cover and MaxSat problems.
KeywordsSearch Tree Vertex Cover Polynomial Time Approximation Scheme Fully Polynomial Time Approximation Scheme Vertex Cover Problem
Unable to display preview. Download preview PDF.
- 4.S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy. Proof verification and hardness of approximation problems. In Proceedings of the 33d IEEE Conference on Foundations of Computer Science, pages 14–23, 1992.Google Scholar
- 6.R. Battiti and M. Protasi. Reactive Search, a history-base heuristic for MAX-SAT. ACM Journal of Experimental Algorithmics, 2:Article 2, 1997.Google Scholar
- 9.R. B. Boppana and M. Sipser. The complexity of finite functions. In J. van Leeuwen, editor, Algorithms and Complexity, volume A of Handbook of Theoretical Computer Science, chapter 14, pages 757–804. Elsevier, 1990.Google Scholar
- 13.T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. The MIT Press, 1990.Google Scholar
- 14.P. Crescenzi and V. Kann. A compendium of NP optimization problems. Available as http://www.nada.kth.se/theory/problemlist.html, Apr. 1997.
- 15.E. Dantsin, M. Gavrilovich, E. A. Hirsch, and B. Konev. Approximation algorithms for Max SAT: a better performance ratio at the cost of a longer running time. Technical Report PDMI preprint 14/1998, Steklov Institute of Mathematics at St. Petersburg, 1998.Google Scholar
- 16.R. G. Downey, P. Evans, and M. R. Fellows. Parameterized learning complexity. In 6th Annual Conference on Learning Theory, COLT’93, pages 51–57. ACM Press, 1993.Google Scholar
- 17.R. G. Downey and M. R. Fellows. Fixed parameter tractability and completeness III. In Complexity Theory: Current Research, Edited by K. Ambos-Spies, S. Homer, and U. Schöning, Cambridge University Press, pages 191–225. 1993.Google Scholar
- 18.R. G. Downey and M. R. Fellows. Fixed-parameter tractability and completeness I: Basic results. SIAM Journal on Computing, 24(4):873–921, August 1995.Google Scholar
- 20.R. G. Downey and M. R. Fellows. Parameterized computational feasibility. In P. Clote, J. Remmel (eds.): Feasible Mathematics II, pages 219–244. Boston: BirkhÄuser, 1995.Google Scholar
- 21.R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer-Verlag, 1998.Google Scholar
- 22.R. G. Downey, M. R. Fellows, and U. Stege. Parameterized complexity: A framework for systematically confronting computational intractability. In F. Roberts, J. Kratochvíl, and J. NešetŘil, editors, The Future of Discrete Mathematics: Proceedings of the First DIM ATIA Symposium, June 1997, AMS-DIMACS Proceedings Series. AMS, 1998. To appear. Available through http://www.inf.ethz.ch/personal/stege.
- 23.R.C. Evans. Testing repairable RAMs and mostly good memories. In Proceedings of the IEEE Int. Test Conf., pages 49–55, 1981.Google Scholar
- 24.U. Feige and M. X. Goemans. Approximating the value of two prover proof systems, with applications to MAX 2SAT and MAX DICUT. In 3d IEEE Israel Symposium on the Theory of Computing and Systems, pages 182–189, 1995.Google Scholar
- 26.H. Fernau and R. Niedermeier. Efficient algorithms for constraint bipartite vertex cover problems. Manuscript, July 1998.Google Scholar
- 30.N. Hasan and C. L. Liu. Minimum fault coverage in reconfigurable arrays. In 18th Int. Symp. on Fault-Tolerant Computing Systems (FTCS’88), pages 348–353. IEEE Computer Society Press, 1988.Google Scholar
- 31.N. Hasan and C. L. Liu. Fault covers in reconfigurable PLAs. In 20th Int. Symp. on Fault-Tolerant Computing Systems (FTCS’90), pages 166–173. IEEE Computer Society Press, 1990.Google Scholar
- 32.J. Hastad. Some optimal inapproximability results.In proceedings of the 29th ACM Symposium on Theory of Computing, pages 1–10, 1997.Google Scholar
- 33.D. S. Hochbaum, editor. Approximation algorithms for NP-hard problems. Boston, MA: PWS Publishing Company, 1997.Google Scholar
- 35.J. H. Kim and S. M. Reddy. On the design of fault-tolerant two-dimensional systolic arrays for yield enhancement. IEEE Transactions on Computers, 38(4):515–525, Apr. 1989.Google Scholar
- 38.S.-Y. Kuo and W. Fuchs. Efficient spare allocation for reconfigurable arrays. IEEE Design and Test, 4:24–31, Feb. 1987.Google Scholar
- 40.M. Mahajan and V. Raman. Parametrizing above guaranteed values: MaxSat and MaxCut. Technical Report TR97-033, ECCC Trier, 1997. To appear in Journal of Algorithms.Google Scholar
- 43.R. Niedermeier and P. Rossmanith. New upper bounds for MaxSat. Technical Report KAM-DIMATIA Series 98–401, Faculty of Mathematics and Physics, Charles University, Prague, July 1998. Submitted for publication.Google Scholar
- 44.C.H. Papadimitriou. Computational Complexity. Addison-Wesley, 1994.Google Scholar
- 47.V. Raman. Parameterized complexity. In Proceedings of the 7th National Seminar on Theoretical Computer Science (Chennai, India), pages I-1–I-18, June 1997.Google Scholar
- 48.N. Robertson and P. D. Seymour. Graph minors⊕-survey. In I. Anderson, editor Surveys in Combinatorics, pages 153–171. Cambridge University Press, 1985.Google Scholar
- 51.L. Trevisan, G. Sorkin, M. Sudan, and D. P. Williamson. Gadgets, approximation, and linear programming. In Proceedings of the 37th IEEE Conference on Foundations of Computer Science, pages 617–626, 1996.Google Scholar