Integer and fractional packings in dense graphs

Combinatorica

Volumn 21, Issue 1, 2001, Pages 13-38

  Haxell, P E ^a   Rodl V ^b  

^a UNIVERSITY OF WATERLOO   (Canada)

^b EMORY UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0035587129     PISSN: 02099683     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004930170003     Document Type: Article

References (13)

1. ALON, N., DUKE, R., LEFMANN, H., RODL, V., YUSTER, R.: The algorithmic aspects of the Regularity Lemma, Journal of Algorithms, 16 (1994), 80-109.
2. ALON, N., SPENCER, J.: The Probabilistic Method, Wiley Interscience, 1992.
3. ARORA, S., KARGER, D., KARPINSKI, M.: Polynomial time approximation schemes for dense instances of NP-hard problems, in: Proceedings of the ACM Symposium on Theory of Computing, 1995, 284-293.
4. CZYGRINOW, A., POLJAK, S., RÖDL, V.: Constructive quasi-Ramsey numbers and tournament ranking, SIAM Journal of Discrete Mathematics, 12 (1999), 48-63.
5. DOR, D., TARSI, M.: Graph decomposition is NPC - a complete proof of Holyer's conjecture, Proceedings of the ACM Symposium on Theory of Computing, (1992) 252-263.
6. DUKE, R., LEFMANN, H., RÖDL, V.: A fast algorithm for computing frequencies in a given graph, SIAM Journal of Computing, 24 (1995), 598-620.
7. FRANKL, P., RÖDL, V.: Near perfect coverings in graphs and hypergraphs, European Journal of Combinatorics, 6 (1985), 317-326.
8. FRIEZE, A., KANNAN, R.: The Regularity Lemma and approximation schemes for dense problems, in: Proceedings of the IEEE Symposium on Foundations of Computer Science, 1996, 12-20.
9. FRIEZE, A., KANNAN, R.: Quick approximation to matrices and applications, Combinatorica, 19 (1999), 175-220.
10. FÜREDI, Z.: Matchings and covers in hypergraphs, Graphs and Combinatorics, 4 (1988), 115-206.
11. GRABLE, D.: Nearly-perfect hypergraph packing is in NC, Information Processing Letters, 60 (1996), 295-299.
12. JANSON, S., ŁUCZAK, T., RUCIŃSKI, A.: Random Graphs, Wiley, New York, 2000.
13. SZEMERÉDI, E.: Regular partitions of graphs, in: Problèmes en Combinatoire et Théorie des Graphes, Proc. Colloque Inter. CNRS (Bermond, J.-C., Fournier, J.-C., Las Vergnas, M., Sotteau, D. eds.) CNRS, Paris, 1978, 399-401.