1. On the k-coloring of intervals;Carlisle;Discrete Appl. Math.,1995
2. T. Carpenter, S. Cosares, I. Saniee, Demand routing and slotting on ring networks, Technical Report 97-02, Bellcore, Morristown, NJ, 1997.
3. Improved approximation algorithms for the demand routing and slotting problem with unit demands on rings;Cheng;SIAM J. Discrete Math.,2004
4. A PTAS for embedding hypergraph in a cycle (extended abstract);Deng,2004
5. Theoretical improvements in algorithmic efficiency for network flow problems;Edmonds;J. Assoc. Comput. Mach.,1972