On-line maximum independent set in chordal graphs

In this paper we deal with the on-line maximum independent set and we propose a probabilistic O(log n)-competitive algorithm for chordal and interval graphs, proving that the same ratio is a lower bound of the problem. The relation of the on-line maximum independent set with the on-line admission control, allows us to obtain as particular case, an O(log n)-competitive algorithm for the on-line admission control in trees and lines. In addition to that, we propose a competitive algorithm for the on-line call admission of subtrees in trees.

[1]  Satish Rao,et al.  Efficient access to optical bandwidth wavelength routing on directed fiber trees, rings, and trees of rings , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.

[2]  Peter Winkler,et al.  Ring routing and wavelength translation , 1998, SODA '98.

[3]  Klaus Jansen,et al.  The Maximum Edge-Disjoint Paths Problem in Bidirected Trees , 2001, SIAM J. Discret. Math..

[4]  Robert E. Tarjan,et al.  Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs , 1984, SIAM J. Comput..

[5]  S. Lakshmivarahan,et al.  Parallel algorithms for ranking of trees , 1990, Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990.

[6]  Klaus Jansen,et al.  Optimal Wavelength Routing on Directed Fiber Trees , 1999, Theor. Comput. Sci..

[7]  Yi Zhou,et al.  A 2-Approximation Algorithm for Path Coloring on Trees of Rings , 2000, ISAAC.

[8]  Magnús M. Halldórsson,et al.  Lower Bounds for On-line Graph Coloring , 1991, On-Line Algorithms.

[9]  Yuval Rabani,et al.  On-line admission control and circuit routing for high performance computing and communication , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[10]  Amos Fiat,et al.  Lower bounds for on-line graph problems with application to on-line circuit and optical routing , 1996, STOC '96.

[11]  Gary L. Miller,et al.  The Complexity of Coloring Circular Arcs and Chords , 1980, SIAM J. Algebraic Discret. Methods.

[12]  P. Gilmore,et al.  A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.

[13]  Robert E. Tarjan,et al.  Algorithmic Aspects of Vertex Elimination on Graphs , 1976, SIAM J. Comput..

[14]  F. Gavril.  The intersection graphs of subtrees in tree are exactly the chordal graphs , 1974 .

[15]  Amos Fiat,et al.  Competitive non-preemptive call control , 1994, SODA '94.

[16]  Magnús M. Halldórsson.  Online coloring known graphs , 1999, SODA '99.

[17]  Allan Borodin,et al.  Online computation and competitive analysis , 1998 .

[18]  Juan A. Garay,et al.  Call preemption in communication networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[19]  Vangelis Th. Paschos,et al.  On-Line Maximum-Order Induces Hereditary Subgraph Problems , 2000, SOFSEM.

[20]  Amos Fiat,et al.  On-line load balancing with applications to machine scheduling and virtual circuit routing , 1993, STOC.

[21]  Magnús M. Halldórsson,et al.  Online independent sets , 2002, Theor. Comput. Sci..

[22]  Fanica Gavril,et al.  Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph , 1972, SIAM J. Comput..

[23]  Yossi Azar,et al.  Throughput-competitive on-line routing , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[24]  Klaus Jansen,et al.  Conversion of coloring algorithms into maximum weight independent set algorithms , 2005, Discret. Appl. Math..

[25]  Alexander Russell,et al.  A Note on Optical Routing on Trees , 1997, Inf. Process. Lett..

[26]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[27]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

[28]  Thomas Erlebach,et al.  Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings , 2001, MFCS.

[29]  Philip A. Bernstein,et al.  Power of Natural Semijoins , 1981, SIAM J. Comput..

[30]  Thomas Erlebach,et al.  On-line Algorithms for Edge-Disjoint Paths in Trees of Rings , 2002, LATIN.

[31]  Jeremy P. Spinrad,et al.  Efficient graph representations , 2003, Fields Institute monographs.

[32]  Klaus Jansen,et al.  The complexity of path coloring and call scheduling , 2001, Theor. Comput. Sci..