Matroid Representation of Clique Complexes
In this paper, we approach the quality of a greedy algorithm for the maximum weighted clique problem from the viewpoint of matroid theory. More precisely, we consider the clique complex of a graph (the collection of all cliques of the graph) and investigate the minimum number k such that the clique complex of a given graph can be represented as the intersection of k matroids. This number k can be regarded as a measure of “how complex a graph is with respect to the maximum weighted clique problem” since a greedy algorithm is a k-approximation algorithm for this problem. We characterize graphs whose clique complexes can be represented as the intersection of k matroids for any k > 0. Moreover, we determine the necessary and sufficient number of matroids for the representation of all graphs with n vertices. This number turns out to be n − 1. Other related investigations are also given.
Unable to display preview. Download preview PDF.
- 2.R. Diestel: Graph Theory (2nd Edition). Springer Verlag, New York, 2000.Google Scholar
- 4.U. Faigle: Matroids in combinatorial optimization. In: Combinatorial Geometries (N. White, ed.), Cambridge University Press, Cambridge, 1987, pp. 161–210.Google Scholar
- 5.S.P. Fekete, R.T. Firla and B. Spille: Characterizing matchings as the intersection of matroids. Preprint, December 2002, arXiv:math.CO/0212235.Google Scholar
- 7.T.A. Jenkyns: The efficacy of the “greedy” algorithm. Proceedings of the 7th Southeastern Conference on Combinatorics, Graph Theory, and Computing, Utilitas Mathematica, Winnipeg, 1976, pp. 341–350.Google Scholar
- 10.Y. Okamoto: Submodularity of some classes of the combinatorial optimization games. Mathematical Methods of Operations Research 58 (2003), to appear.Google Scholar