Zobrazeno 1 - 6
of 6
pro vyhledávání: '"S. V. Bredikhin"'
Publikováno v:
Journal of Applied and Industrial Mathematics. 12:264-277
We present a 0.5-approximation algorithm for the Multiple Knapsack Problem (MKP). The algorithm uses the ordering of knapsacks according to the nondecreasing of size and the two orderings of items: in nonincreasing utility order and in nonincreasing
Autor:
N G Scherbakova, S V Bredikhin
Publikováno v:
Journal of Physics: Conference Series. 2099:012055
The analysis of networks of collaboration between scientists reveals features of academic communities that help in understanding the specifics of collaborative scientific work and identifying the notable researchers. In these networks, the set of nod
Autor:
S V Bredikhin, N G Scherbakova
Publikováno v:
Journal of Physics: Conference Series. 1715:012055
We study the citation network of scientific articles in the hypothesis that the likelihood of connecting to a node depends on the node’s degree, a mechanism called the preferential attachment. We show that the rate at which articles acquire citatio
Publikováno v:
Mathematical Notes of the Academy of Sciences of the USSR. 7:319-325
We characterize fields which are maximal with respect to the property of having two different linear orderings. The Galois group of the algebraic closure of a maximal field is described. An example of non-uniqueness of the maximal extension is mentio