Maqola

Lower bound for the advantage coefficient in the search problem on graphs

Абдулла АзамовInstitute for Mathematics, Academy of Sciences, Tashkent, Uzbekistan

Differential Equationsjournal2008en

ABI

Annotatsiya

We obtain a lower bound for the pursuing (searching) point velocity for which the minimax dynamic graph search problem in N.N. Petrov’s setting is solvable.

Mavzular

Optimization and Search Problems Facility Location and Emergency Management Vehicle Routing Optimization Methods

Identifikatorlar

DOI: 10.1134/s0012266108120136

Iqtiboslar va manbalar

5 ta iqtibos 5 ta foydalanilgan manba

Koʻrsatkichlar — AkademScholar · Tez orada