Testing graphs for colorable properties
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
On characterizing hypergraph regularity
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Integer and fractional packings in dense 3-uniform hypergraphs
Random Structures & Algorithms
Packing directed cycles efficiently
Discrete Applied Mathematics
Integer and fractional packings of hypergraphs
Journal of Combinatorial Theory Series B
An improved MST algorithm for ranking players of a round-robin tournament
International Journal of Computer Mathematics
Maximum dispersion problem in dense graphs
Operations Research Letters
| Hi-index | 0.00 |
A constructive lower bound on the quasi-Ramsey numbers and the tournament ranking function was obtained in [S. Poljak, V. Rödl, and J. Spencer, SIAM J. Discrete Math., (1) 1988, pp. 372--376]. We consider the weighted versions of both problems. Our method yields a polynomial time heuristic with guaranteed lower bound for the linear ordering problem.