The Conditional Covering Problem on Unweighted Interval Graphs with Nonuniform Coverage Radius
暂无分享,去创建一个
[1] I. Moon,et al. An Analysis of Network Location Problems with Distance Constraints , 1984 .
[2] P. Gilmore,et al. A Characterization of Comparability Graphs and of Interval Graphs , 1964, Canadian Journal of Mathematics.
[3] J. Cole Smith,et al. A dynamic programming algorithm for the conditional covering problem on tree graphs , 2005 .
[4] A. Carrano. Establishing the order of human chromosome-specific DNA fragments. , 1988, Basic life sciences.
[5] Kellogg S. Booth,et al. Testing for the Consecutive Ones Property, Interval Graphs, and Graph Planarity Using PQ-Tree Algorithms , 1976, J. Comput. Syst. Sci..
[6] M. Golumbic. Algorithmic graph theory and perfect graphs , 1980 .
[7] Vahid Lotfi,et al. Hybrid Heuristics For Conditional Covering Problems , 1997 .
[8] D. R. Fulkerson,et al. Incidence matrices and interval graphs , 1965 .
[9] S. Thomas McCormick,et al. Conditional covering: Greedy heuristics and computational results , 1987, Comput. Oper. Res..
[10] Jonathan Cole Smith,et al. Dynamic programming algorithms for the conditional covering problem on path and extended star graphs , 2005, Networks.
[11] I. Douglas Moon. Conditional Covering : Worst Case Analysis of Greedy Heuristics , 1990 .
[12] Jonathan Cole Smith,et al. A dynamic programming algorithm for the conditional covering problem on tree graphs , 2005, Networks.
[13] C. Pandu Rangan,et al. On Conditional Covering Problem , 2010, Math. Comput. Sci..
[14] J. C. Smith,et al. Algorithms for solving the conditional covering problem on paths , 2005 .
[15] Takeshi Yoshimura,et al. Efficient Algorithms for Channel Routing , 1982, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.
[16] I. Douglas Moon,et al. Facility location on a tree with maximum distance constraints , 1995, Comput. Oper. Res..