A polynomial approximation algorithm for the minimum fill-in problem

SIAM Journal on Computing

Volumn 30, Issue 4, 2000, Pages 1067-1079

  Natanzon, Assaf ^a   Shamir, Ron ^a   Sharan, Roded ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

Approximation algorithms; Chain completion; Chain graphs; Chordal completion; Chordal graphs; Graph algorithms; Minimum fill in; Parameterized algorithms

Indexed keywords

ALGEBRA; ALGORITHMS; GRAPH THEORY; POLYNOMIALS; PROBLEM SOLVING; SET THEORY;

CHAIN COMPLETION; CHORDAL GRAPHS; MINIMUM FILL-IN PROBLEM; POLYNOMIAL APPROXIMATION ALGORITHM;

APPROXIMATION THEORY;

EID: 0034855049     PISSN: 00975397     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0097539798336073     Document Type: Article

References (23)

1. A. AGRAWAL, P. KLEIN, AND R. RAVI, Cutting down on fill using nested dissection: Provably good elimination orderings, in Graph Theory and Sparse Matrix Computation, A. George, J. R. Gilbert, and J. W. H. Liu, eds., Springer-Verlag, New York, 1993, pp. 31-55.
2. J. R. BUNCH AND D. J. ROSE, eds., Sparse Matrix Computations, Academic Press, New York, 1976.
3. L. CAI, Fixed-parameter tractability of graph modification problems for hereditary properties, Inform. Proc. Lett., 58 (1996), pp. 171-176.
4. D. COPPERSMITH AND S. WINOGRAD, Matrix multiplication via arithmetic progressions, J. Symbolic Comput., 9 (1990), pp. 251-280.
5. E. CUTHILL AND J. MCKEE, Reducing the bandwidth of sparse symmetric matrices, in Proc. 24th Nat. Conf. ACM, 1969, pp. 157-172.
6. R. DOWNEY AND M. FELLOWS, Parameterized Complexity, Springer-Verlag, New York, 1999.
7. I. DUFF, ed., Sparse Matrices and Their Uses, Academic Press, New York, 1981.
8. D. P. FASULO, T. JIANG, R. M. KARP, AND N. SHARMA, Constructing maps using the span and inclusion relations, in Proceedings of the 2nd International Conference on Computational Molecular Biology, ACM, New York, 1998, pp. 64-73.
9. M. R. GAREY AND D. S. JOHNSON, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, San Francisco, CA, 1979.
10. A. GEORGE, Nested dissection of a regular finite element mesh, SIAM J. Numer. Anal., 10 (1973), pp. 345-363.
11. A. GEORGE, J. R. GILBERT, AND J. W. H. LIU, eds., Graph Theory and Sparse Matrix Computation, Springer-Verlag, New York, 1993.
12. A. GEORGE AND J. LIU, The evolution of the minimum degree ordering algorithm, SIAM Rev., 31 (1989), pp. 1-19.
13. A. GEORGE AND J. W. LIU, Computer Solution of Large Sparse Positive Definite Systems, Prentice-Hall, Englewood Cliffs, NJ, 1981.
14. J. R. GILBERT, Some nested dissection order is near optimal, Inform. Process Lett., 26 (1988), pp. 325-328.
15. M. C. GOLUMBIC, Algorithmic Graph Theory and Perfect Graphs, Academic Press, New York, 1980.
16. H. KAPLAN, R. SHAMIR, AND R. E. TARJAN, Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs, SIAM J. Comput., 28 (1999), pp. 1906-1922.
17. F. T. LEIGHTON AND S. RAO, An approximate max-flow min-cut theorem for uniform multicommodity flow problems with application to approximation algorithms, in Proceedings of the 29th Symposium on Foundations of Computer Science, IEEE Computer Society, Los Alamitos, CA, 1988, pp. 101-111.
18. A. NATANZON, R. SHAMIR, AND R. SHARAN, A polynomial approximation algorithm for the minimum fill-in problem, in Proceedings of the 30th Annual ACM Symposium on Theory of Computing, Dallas, TX, 1998, pp. 41-47.
19. T. OHTSUKI, A fast algorithm for finding an optimal ordering for vertex elimination on a graph, SIAM J. Comput., 5 (1976), pp. 133-145.
20. T. OHTSUKI, L. K. CHEUNG, AND T. FUJISAWA, Minimal triangulation of a graph and optimal pivoting order in a sparse matrix, J. Math. Anal. Appl., 54 (1976), pp. 622-633.
21. J. D. ROSE, A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations, in Graph Theory and Computing, R. C. Reed, ed., Academic Press, New York, 1972, pp. 183-217.
22. U. SCHENDEL, Sparse Matrices: Numerical Aspects with Applications for Scientists and Engineers, Ellis Horwood, Chichester, UK, 1989.
23. M. YANNAKAKIS, Computing the minimum fill-in is NP-complete, SIAM J. Alg. Discrete Methods, 2 (1981), pp. 77-79.