GREEDY ALGORITHM FOR PARTIALLY ORDERED SETS

被引:23
作者
FAIGLE, U
机构
[1] FB Mathematik, AG Allgemeine Algebra, D-6100 Darmstadt, TH Darmstadt
关键词
D O I
10.1016/0012-365X(79)90092-X
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
Those independence systems on finite partially ordered sets are characterized for which the greedy algorithm always works. © 1979.
引用
收藏
页码:153 / 159
页数:7
相关论文
共 13 条
[1]  
[Anonymous], 1957, P LOND MATH SOC
[2]  
EDMONDS J, 1970, P CALG INT C COMB ST, P69
[3]  
Edmonds J., 1971, MATH PROGRAM, V1, P127, DOI [10.1007/BF01584082, DOI 10.1007/BF01584082]
[4]  
EULER R, 1977, 7761OR U BONN REP
[5]  
FAIGLE U, UNPUBLISHED
[6]  
Gale D., 1968, J COMBIN THEORY, V4, P176
[7]  
HAMMER PL, 1973, CORR7318 U WAT COMB
[8]  
Kruskal J.B., 1956, P AM MATH SOC, V7, P3, DOI [10.2307/2033241, DOI 10.1090/S0002-9939-1956-0078686-7, 10.1090/S0002-9939-1956-0078686-7]
[9]  
Lawler EL., 2001, COMBINATORIAL OPTIMI
[10]  
STANLEY RP, 1972, 119 AM MATH SOC MEM