Author:
Sai Anand R.,Erlebach Thomas,Hall Alexander,Stefanakos Stamatis
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference16 articles.
1. Y. Azar, O. Regev, Strongly polynomial algorithms for the unsplittable flow problem, in: Proceedings of the Eighth Integer Programming and Combinatorial Optimization Conference (IPCO), Lecture Notes in Computer Science, Vol. 2081, Springer, Berlin, 2001, pp. 15–29.
2. A. Blum, A. Kalai, J. Kleinberg, Admission control to minimize rejections, in: Proceedings of the Seventh International Workshop on Algorithms and Data Structures (WADS 2001), Lecture Notes in Computer Science, Vol. 2125, Springer, Berlin, 2001, pp. 155–164.
3. A partial k-arboretum of graphs with bounded treewidth;Bodlaender;Theoret. Comput. Sci.,1998
4. Online Computation and Competitive Analysis;Borodin,1998
5. On the k-coloring of intervals;Carlisle;Disc. Appl. Math.,1995
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献