Using nondeterminism to design efficient deterministic algorithms

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2245, Issue , 2001, Pages 120-131

  Chen, Jianer ^a   Friesen, 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

[No Author keywords available]

Indexed keywords

INTEGER PROGRAMMING;

DETERMINISTIC ALGORITHMS; MATCHING PROBLEMS; NON-DETERMINISM; OPTIMIZATION PROBLEMS; PARAMETERIZED ALGORITHM; POSITIVE INTEGERS;

SOFTWARE ENGINEERING;

EID: 84944073439     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45294-x_11     Document Type: Conference Paper

References (8)

1. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, North- Holland, New York, 1976.
2. J. Chen, I. A. Kanj, and W. Jia, “Vertex Cover: further observations and further improvements,” in Proc. 25th Int. Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science, vol. 1665, pp. 313-324, Ascona, Switzerland, June 1999.
3. J. Chen, D. K. Friesen, W. Jia, and I. A. Kanj, “Using nondeterminism to design efficient deterministic algorithms,” Technical Report, Department of Computer Science, Texas AandM University, College Station, Texas, May 2001.
4. R. G. Downey and M. R. Fellows, Parameterized Complexity, New York, New York: Springer, (1999), pp. 220-222.
5. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman, San Francisco, 1979.
6. R. L. Graham, D. E. Knuth, and O. Patashnik, Concrete Mathematics, Addison-Wesley, Reading, 1994.
7. J. E. Hopcroft and R. M. Karp, Ann5/2 algorithm for maximum matching in bipartite graphs, SIAM J.Comput.2 , (1973), pp. 225-231.
8. V. Kann, Maximum bounded 3-dimensional matching is MAX SNP-complete, Information Processing Letters 37, (1991), pp. 27-35.