An algorithm for covering polygons with rectangles
Information and Control
The Stanford GraphBase: a platform for combinatorial computing
The Stanford GraphBase: a platform for combinatorial computing
Journal of Algorithms
Minimal edge-coverings of pairs of sets
Journal of Combinatorial Theory Series B
The CWEB System of Structured Documentation: Version 3.0
The CWEB System of Structured Documentation: Version 3.0
Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Pushdown-reduce: an algorithm for connectivity augmentation and poset covering problems
Discrete Applied Mathematics
Primal-dual approach for directed vertex connectivity augmentation and generalizations
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Jump number of two-directional orthogonal ray graphs
IPCO'11 Proceedings of the 15th international conference on Integer programming and combinatoral optimization
| Hi-index | 0.00 |
This expository note presents simplifications of a theorem due to Gy聰ri and an algorithm due to Franzblau and Kleitman: Given a family F of m intervals on a linearly ordered set of n elements, we can construct in O(m+n)2 steps an irredundant subfamily having maximum cardinality, as well as a generating family having minimum cardinality. The algorithm is of special interest because it solves a problem analogous to finding a maximum independent set, but on a class of objects that is more general than a matroid. This note is also a complete, runnable computer program, which can be used for experiments in conjunction with the public-domain software of The Stanford GraphBase.