Efficient Algorithms for Disjoint Matchings among Intervals and Related Problems

In this note, the problem of determining disjoint matchings in a set of intervals is investigated (two intervals can be matched if they are disjoint). Such problems find applications in schedules planning. First, we propose a new incremental algorithm to compute maximum disjoint matchings among intervals. We show that this algorithm runs in O(n) time if the intervals are given ordered in input. Additionally, a shorter algorithm is given for the case where the intervals are proper. Then, a NP-complete extension of this problem is considered: the perfect disjoint multidimensional matching problem among intervals. A sufficient condition is established for the existence of such a matching. The proof of this result yields a linear-time algorithm to compute it in this case. Besides, a greedy heuristic is shown to solve the problem in linear time for proper intervals.

[1]  Jack Edmonds,et al.  Maximum matching and a polyhedron with 0,1-vertices , 1965 .

[2]  Franco P. Preparata,et al.  Efficient algorithms for finding maximum matchings in convex bipartite graphs and related problems , 1981, Acta Informatica.

[3]  Julian Scott Yeomans,et al.  A linear time algorithm for maximum matchings in convex, bipartite graphs☆ , 1996 .

[4]  H. Bodlaender,et al.  Restrictions of Graph Partition Problems , 1993 .

[5]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[6]  Joseph Y.-T. Leung,et al.  Efficient algorithms for interval graphs and circular-arc graphs , 1982, Networks.

[7]  Laurent Viennot,et al.  Lex-BFS and partition refinement, with applications to transitive orientation, interval graph recognition and consecutive ones testing , 2000, Theor. Comput. Sci..

[8]  F. Glover.  Maximum matching in a convex bipartite graph , 1967 .

[9]  Stephen A. Cook,et al.  Time-bounded random access machines , 1972, J. Comput. Syst. Sci..

[10]  F. Roberts.  Graph Theory and Its Applications to Problems of Society , 1987 .

[11]  Klaus Jansen,et al.  Restrictions of Graph Partition Problems. Part I , 1995, Theor. Comput. Sci..

[12]  Joseph JáJá,et al.  An Introduction to Parallel Algorithms , 1992 .

[13]  D. T. Lee,et al.  Parallel Algorithms for Maximum Matching in Complements of Interval Graphs and Related Problems , 2000, Algorithmica.

[14]  Giorgio Gallo.  An O(n log n) algorithm for the convex bipartite matching problem , 1984 .

[15]  M. Golummc.  Algorithmic graph theory and perfect graphs , 1980 .

[16]  Robert E. Tarjan,et al.  A Linear-Time Algorithm for a Special Case of Disjoint Set Union , 1985, J. Comput. Syst. Sci..

[17]  Stephan Olariu,et al.  An Optimal Greedy Heuristic to Color Interval Graphs , 1991, Inf. Process. Lett..

[18]  G. Steiner,et al.  Level Schedules for Mixed-Model, Just-in-Time Processes , 1993 .

[19]  W.-D. Wei,et al.  On A Personnel Assignment Problem , 1990, Int. J. Found. Comput. Sci..

[20]  R. Möhring.  Algorithmic graph theory and perfect graphs , 1986 .

[21]  Silvio Micali,et al.  An O(v|v| c |E|) algoithm for finding maximum matching in general graphs , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[22]  S. Sitharama Iyengar,et al.  Introduction to parallel algorithms , 1998, Wiley series on parallel and distributed computing.