The 2-quasi-greedy algorithm for cardinality constrained matroid bases
暂无分享,去创建一个
[1] M. Fisher. Worst-Case Analysis of Heuristic Algorithms , 1980 .
[2] Richard M. Karp,et al. The traveling-salesman problem and minimum spanning trees: Part II , 1971, Math. Program..
[3] B. Korte,et al. An Analysis of the Greedy Heuristic for Independence Systems , 1978 .
[4] Robert E. Tarjan,et al. Efficient Algorithms for a Family of Matroid Intersection Problems , 1984, J. Algorithms.
[5] B. Korte,et al. Greedoids - A Structural Framework for the Greedy Algorithm , 1984 .
[6] Richard M. Karp,et al. The Traveling-Salesman Problem and Minimum Spanning Trees , 1970, Oper. Res..
[7] F. Glover,et al. Finding Minimum Spanning Trees with a Fixed Number of Links at a Node , 1975 .
[8] U. Faigle. Matroids on Ordered Sets and the Greedy Algorithm , 1984 .
[9] Eugene L. Lawler,et al. Fast approximation algorithms for knapsack problems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).
[10] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[11] Harold N. Gabow. A good algorithm for smallest spanning trees with a degree constraint , 1978, Networks.