Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Diskretnyj analiz i issledovanie operacij
Tome 13 (2006)
no. 2
Précédent
Suivant
Sommaire
An approximate algorithm for finding a maximum-weight
d
-homogeneous connected spanning subgraph in a~complete graph with random edge weights
A. E. Baburin
;
E. Kh. Gimadi
p. 3-20
An algorithm for the formation of a~hierarchical system of invariants of isomorphisms of mappings of finite sets
Yu. I. Brodskii
;
V. I. Novitskii
;
Yu. N. Pavlovsky
p. 21-30
By-passes with ordered enclosing in planar graphs
T. A. Panyukova
p. 31-43
A polynomially solvable case of the three-stage Johnson problem
V. V. Servakh
p. 44-55
On the approximation of an optimal solution of the integer knapsack problem by optimal solutions of the integer knapsack problem with a~restriction on the cardinality
A. Yu. Chirkov
;
V. N. Shevchenko
p. 56-73
A generalized linear exchange model
V. I. Shmyrev
p. 74-102