Using nondeterminism to design efficient deterministic algorithms

Algorithmica (New York)

Volumn 40, Issue 2, 2004, Pages 83-97

  Chen, Jianer ^a   Firesen, Donald K ^a   Jia, Weijia ^b   Kanj, Iyad A ^c  

^a TEXAS A AND M UNIVERSITY   (United States)

^b CITY UNIVERSITY OF HONG KONG   (Hong Kong)

^c DEPAUL UNIVERSITY   (United States)

Author keywords

Nondeterministic algorithms; Parameterized algorithms; Three dimensional matching

Indexed keywords

ALGORITHMS; GRAPH THEORY; INTEGER PROGRAMMING; OPTIMIZATION; PROBLEM SOLVING; SOFTWARE ENGINEERING; SYSTEMS ANALYSIS; THEOREM PROVING;

NONDETERMINISTIC ALGORITHMS; PARAMETERIZED ALGORITHMS; POSITIVE INTEGERS; THREE-DIMENSIONAL MATCHING;

COMPUTER SCIENCE;

EID: 18544386845     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00453-004-1096-z     Document Type: Article

References (10)

1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North-Holland, New York, 1976.
2. J. Chen, D. Friesen, W. Jia, and I. A. Kanj, Using nondeterminism to design efficient deterministic algorithms, Proceedings of the 21st Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS '01). Lecture Notes in Computer Science 2245, pp. 120-131, Springer-Verlag, Berlin, 2001.
3. J. Chen, I. A. Kanj, and W. Jia, Vertex Cover: further observations and further improvements, Journal of Algorithms 41 (2001), 280-301.
4. R. G. Downey and M. R. Fellows, Parameterized Complexity, pp. 220-222, Springer-Verlag, New York, 1999.
5. M. R. Fellows, Personal communication, October 2003.
6. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, CA, 1979.
7. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, MA, 1994.
8. 5/2 algorithm for maximum matching in bipartite graphs, SIAM Journal on Computing 2 (1973), 225-231.
9. W. Jia, C. Zhang, and J. Chen, An efficient parameterized algorithm for m-set packing, Journal of Algorithms 50 (2004), 106-117.
10. V. KANN, Maximum bounded 3-dimensional matching is MAX SNP-complete, Information Processing Letters 37 (1991), pp. 27-35.