On Local Search for Weighted k-Set Packing
暂无分享,去创建一个
[1] David A. Grable,et al. On Random Greedy Triangle Packing , 1997, Electron. J. Comb..
[2] Gérard Cornuéjols,et al. Packing subgraphs in a graph , 1982, Oper. Res. Lett..
[3] Thomas A. Feo,et al. One-Half Approximation Algorithms for the k-Partition Problem , 1992, Oper. Res..
[4] R. Ravi,et al. Non-Overlapping Local Alignments (Weighted Independent Sets of Axis Parallel Rectangles) , 1995, WADS.
[5] Magnús M. Halldórsson,et al. Approximating k-Set Cover and Complementary Graph Coloring , 1996, IPCO.
[6] Magnús M. Halldórsson,et al. Approximating discrete collections via local improvements , 1995, SODA '95.
[7] Rong-chii Duh,et al. Approximation of k-set cover by semi-local optimization , 1997, STOC '97.
[8] Alexander Schrijver,et al. On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..
[9] Gérard Cornuéjols,et al. An extension of matching theory , 1986, J. Comb. Theory, Ser. B.