Voir la notice de l'article provenant de la source Math-Net.Ru
@article{DA_2003_10_3_a3, author = {V. P. Il'ev and A. S. Televnin}, title = {Two problems on hereditary systems}, journal = {Diskretnyj analiz i issledovanie operacij}, pages = {54--66}, publisher = {mathdoc}, volume = {10}, number = {3}, year = {2003}, language = {ru}, url = {http://geodesic.mathdoc.fr/item/DA_2003_10_3_a3/} }
V. P. Il'ev; A. S. Televnin. Two problems on hereditary systems. Diskretnyj analiz i issledovanie operacij, Tome 10 (2003) no. 3, pp. 54-66. http://geodesic.mathdoc.fr/item/DA_2003_10_3_a3/
[1] Boppana R. B., Halldörsson M. M., “Approximating maximum independent sets by excluding subgraphs”, BIT, 32:2 (1992), 180–196 | DOI | MR | Zbl
[2] Chvatal V., “A greedy heuristic for the set-covering problem”, Math. Oper. Res., 4:3 (1979), 233–235 | DOI | MR | Zbl
[3] Halldórsson M. M., “Approximations of weighted independent set and hereditary subset problems”, J. Graph Algorithms Appl., 4:1 (2000), 1–16 | MR | Zbl
[4] Halldórsson M. M., Radhakrishnan J., “Greed is good: approximating independent sets in sparse and bounded-degree graphs”, Algorithmica, 18:1 (1997), 145–163 | DOI | MR | Zbl
[5] Hausmann D., Korte B., “Lower bounds on the worst-case complexity of some oracle algorithms”, Discrete Math., 24:3 (1978), 261–276 | DOI | MR | Zbl
[6] Whitney H., “On the abstract properties of linear dependence”, Amer. J. Math., 57 (1935), 509–533 | DOI | MR | Zbl