Data reduction, exact, and heuristic algorithms for clique cover

Proceedings of the 8th Workshop on Algorithm Engineering and Experiments and the 3rd Workshop on Analytic Algorithms and Combinatorics

Volumn 2006, Issue , 2006, Pages 86-94

  Gramm, Jens ^a   Guo, Jiong ^b   Hüffner, Falk ^b   Niedermeier, Rolf ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b FRIEDRICH SCHILLER UNIVERSITY JENA   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DATA HANDLING; DATA REDUCTION; GRAPH THEORY; HEURISTIC METHODS; PROBLEM SOLVING;

CLIQUE COVER; DATA REDUCTION RULES; POLYNOMIAL TIME HEURISTICS; REAL-WORLD AND SYNTHETIC DATA;

ALGORITHMS;

EID: 33646849110     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972863.9     Document Type: Conference Paper

References (20)

1. F. N. Abu-Khzam, R. L. Collins, M. R. Fellows, M. A. Langston, W. H. Suters, and C. T. Symons. Kernelization algorithms for the vertex cover problem: Theory and experiments. In Proc. 6th ALENEX, pages 62-69. SIAM, 2004.
2. P. K. Agarwal, N. Alon, B. Aronov, and S. Suri. Can visibility graphs be represented compactly? Discrete and Computational Geometry, 12:347-365, 1994.
3. J. Alber, N. Betzler, and R. Niedermeier. Experiments on data reduction for optimal domination in networks. In Proc. 1st INOC, pages 1-6, 2003.
4. Long version to appear in Annals of Operations Research.
5. J. Alber, M. R. Fellows, and R. Niedermeier. Polynomial-time data reduction for Dominating Set. Journal of the ACM, 51:363-384, 2004.
6. G. Ausiello, P. Crescenzi, G. Gambosi, V. Kann, A. Marchetti-Spaccamela, and M. Protasi. Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties. Springer, 1999.
7. C. Bron and J. Kerbosch. Algorithm 457: finding all cliques of an undirected graph. Communications of the ACM, 16(9):575-577, 1973.
8. R. G. Downey and M. R. Fellows. Parameterized Complexity. Springer, 1999.
9. A. M. Frieze and B. A. Reed. Covering the edges of a random graph by cliques. Combinatorica, 15(4):489-497, 1995.
10. M. R. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, 1979.
11. J. F. Gimpel. A reduction technique for prime implicant tables. IEEE Transactions on Electronic Computers, EC-14:535-541, 1965.
12. J. Gramm, J. Guo, F. Hüffner, R. Niedermeier, H.-P. Piepho, and R. Schmid. Algorithms for compact letters displays - comparison and evaluation. Manuscript, FSU Jena, Dec. 2005.
13. E. Kellerman. Determination of key word conflict. IBM Technical Disclosure Bulletin, 16(2):544-546, 1973.
14. I. Koch. Enumerating all connected maximal common subgraphs in two graphs. Theoretical Computer Science, 250(1-2):1-30, 2001.
15. L. T. Kou, L. J. Stockmeyer, and C.-K. Wong. Covering edges by cliques with regard to keyword conflicts and intersection graphs. Communications of the ACM, 21(2):135-139, 1978.
16. X. Leroy, J. Vouillon, D. Doligez, et al. The Objective Caml system. Available on the web, 1996. http://caml.inria.fr/ocaml/.
17. S. Mecke and D. Wagner. Solving geometric covering problems by data reduction. In Proc. 12th ESA, volume 3221 of LNCS, pages 760-771. Springer, 2004.
18. R. Niedermeier. Invitation to Fixed-Parameter Algorithms. Oxford University Press, 2006.
19. H.-P. Piepho. An algorithm for a letter-based representation of all-pairwise comparisons. Journal of Computational and Graphical Statistics, 13(2):456-466, 2004.
20. S. Rajagopalan, M. Vachharajani, and S. Malik. Handling irregular ILP within conventional VLIW schedulers using artificial resource constraints. In Proc. CASES, pages 157-164. ACM Press, 2000.