An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem
We study the competitive ratio of certain online algorithms for a well-studied class of load balancing problems. These algorithms are obtained and analyzed according to a method by Crescenzi et al (2004). We show that an exact analysis of their competitive ratio on certain “uniform” instances would resolve a fundamental conjecture by Caccetta and Häggkvist (1978). The conjecture is that any digraph on n nodes and minimum outdegree d must contain a directed cycle involving at most ⌈n/d ⌉ nodes. Our results are the first relating this conjecture to the competitive analysis of certain algorithms, thus suggesting a new approach to the conjecture itself. We also prove that, on “uniform” instances, the analysis by Crescenzi et al (2004) gives only trivial upper bounds, unless we find a counterexample to the conjecture. This is in contrast with other (notable) examples where the same analysis yields optimal (non-trivial) bounds.
KeywordsCaccetta-Häggkvist conjecture online load balancing competitive analysis
Unable to display preview. Download preview PDF.
- 1.Aichholzer, O., Aurenhammer, F., Rote, G.: Optimal graph orientation with storage applications. SFB Report Series 51, TU-Graz (1995)Google Scholar
- 7.Caccetta, L., Häggkvist, R.: On minimal regular digraph with given girth. In: Proc. of 9th S-E Conf. Combinatorics, Graph Theory and Computing, pp. 181–187 (1978)Google Scholar
- 10.Monti, A., Penna, P., Silvestri, R.: An Equivalent Version of the Caccetta-Häggkvist Conjecture in an Online Load Balancing Problem (2007), Technical report available at http://www.dia.unisa.it/~penna
- 14.Sullivan, B.D.: A Summary of Results and Problems Related to the Caccetta-Häggkvist Conjecture. In: ARCC Workshop: The Caccetta-Haggkvist conjecture (2006), available at http://www.aimath.org/pastworkshops/caccetta.html