Call control with k rejections
暂无分享,去创建一个
[1] Yossi Azar,et al. Strongly Polynomial Algorithms for the Unsplittable Flow Problem , 2001, IPCO.
[2] Rolf Niedermeier,et al. A general method to speed up fixed-parameter-tractable algorithms , 2000, Inf. Process. Lett..
[3] Weijia Jia,et al. Vertex Cover: Further Observations and Further Improvements , 1999, J. Algorithms.
[4] Rolf Niedermeier,et al. An efficient fixed-parameter algorithm for 3-Hitting Set , 2003, J. Discrete Algorithms.
[5] Hans L. Bodlaender,et al. A Partial k-Arboretum of Graphs with Bounded Treewidth , 1998, Theor. Comput. Sci..
[6] Venkatesan Guruswami,et al. Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems , 1999, STOC '99.
[7] Thomas Erlebach,et al. Approximation Algorithms and Complexity Results for Path Problems in Trees of Rings , 2001, MFCS.
[8] Michael R. Fellows,et al. Parameterized Complexity , 1998 .
[9] Allan Borodin,et al. Online computation and competitive analysis , 1998 .
[10] Jon M. Kleinberg,et al. Approximation algorithms for disjoint paths problems , 1996 .
[11] Errol L. Lloyd,et al. On the k -coloring of intervals , 1995 .
[12] Adam Tauman Kalai,et al. Admission Control to Minimize Rejections , 2001, WADS.
[13] Jens Vygen,et al. The edge-disjoint paths problem is NP-complete for series-parallel graphs , 2001, Discret. Appl. Math..
[14] Éva Tardos,et al. Disjoint paths in densely embedded graphs , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[15] Klaus Jansen,et al. The Maximum Edge-Disjoint Paths Problem in Bidirected Trees , 2001, SIAM J. Discret. Math..