On a~problem of search by networks
    
    
  
  
  
      
      
      
        
Teoriâ veroâtnostej i ee primeneniâ, Tome 15 (1970) no. 2, pp. 326-330
    
  
  
  
  
  
    
      
      
        
      
      
      
    Voir la notice de l'article provenant de la source Math-Net.Ru
            
              			The optimality of the rhombic search networks in discovering of symmetric convex aggregate on the plane is proved.
			
            
            
            
          
        
      @article{TVP_1970_15_2_a12,
     author = {I. P. Tsaregradskii},
     title = {On a~problem of search by networks},
     journal = {Teori\^a vero\^atnostej i ee primeneni\^a},
     pages = {326--330},
     publisher = {mathdoc},
     volume = {15},
     number = {2},
     year = {1970},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/TVP_1970_15_2_a12/}
}
                      
                      
                    I. P. Tsaregradskii. On a~problem of search by networks. Teoriâ veroâtnostej i ee primeneniâ, Tome 15 (1970) no. 2, pp. 326-330. http://geodesic.mathdoc.fr/item/TVP_1970_15_2_a12/
