Geodesic
Оценки погрешности жадных алгоритмов для задач на наследственных системах
Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 1, pp. 44-57 
V. P. Il'ev. Оценки погрешности жадных алгоритмов для задач на наследственных системах. Diskretnyj analiz i issledovanie operacij, Tome 15 (2008) no. 1, pp. 44-57. http://geodesic.mathdoc.fr/item/DA_2008_15_1_a4/
@article{DA_2008_15_1_a4,
     author = {V. P. Il'ev},
     title = {{\CYRO}{\cyrc}{\cyre}{\cyrn}{\cyrk}{\cyri} {\cyrp}{\cyro}{\cyrg}{\cyrr}{\cyre}{\cyrsh}{\cyrn}{\cyro}{\cyrs}{\cyrt}{\cyri} {\cyrzh}{\cyra}{\cyrd}{\cyrn}{\cyrery}{\cyrh} {\cyra}{\cyrl}{\cyrg}{\cyro}{\cyrr}{\cyri}{\cyrt}{\cyrm}{\cyro}{\cyrv} {\cyrd}{\cyrl}{\cyrya} {\cyrz}{\cyra}{\cyrd}{\cyra}{\cyrch} {\cyrn}{\cyra} {\cyrn}{\cyra}{\cyrs}{\cyrl}{\cyre}{\cyrd}{\cyrs}{\cyrt}{\cyrv}{\cyre}{\cyrn}{\cyrn}{\cyrery}{\cyrh} {\cyrs}{\cyri}{\cyrs}{\cyrt}{\cyre}{\cyrm}{\cyra}{\cyrh}},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {44--57},
     year = {2008},
     volume = {15},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2008_15_1_a4/}
}
TY  - JOUR
AU  - V. P. Il'ev
TI  - Оценки погрешности жадных алгоритмов для задач на наследственных системах
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2008
SP  - 44
EP  - 57
VL  - 15
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/DA_2008_15_1_a4/
LA  - ru
ID  - DA_2008_15_1_a4
ER  - 
%0 Journal Article
%A V. P. Il'ev
%T Оценки погрешности жадных алгоритмов для задач на наследственных системах
%J Diskretnyj analiz i issledovanie operacij
%D 2008
%P 44-57
%V 15
%N 1
%U http://geodesic.mathdoc.fr/item/DA_2008_15_1_a4/
%G ru
%F DA_2008_15_1_a4

Voir la notice de l'article provenant de la source Math-Net.Ru

[1] Edmonds J., “Matroids and the greedy algorithm”, Math. Programming, 1:2 (1971), 127–136 | DOI | MR | Zbl

[2] Grötschel M., Lovász L., “Combinatorial optimization”, Handbook of combinatorics, V. 2, Elsevier Science, Amsterdam, 1995, 1541–1597 | MR | Zbl

[3] Il'ev V., “Hereditary systems and greedy-type algorithms”, Discrete Appl. Math., 132:1–3 (2003), 137–148 | DOI | MR

[4] Jenkyns Th. A., “The efficacy of the “greedy” algorithm”, Congressus Numerantium, XVIII, Winnipeg, 1976, 341–350 | MR | Zbl

[5] Korte B., Hausmann D., “An analysis of the greedy heuristic for independence systems”, Annals Discrete Math., 2 (1978), 65–74 | DOI | MR | Zbl

[6] Rado R., “Note on independence functions”, Proc. London Math. Soc., 7:3 (1957), 300–320 | DOI | MR | Zbl