Let $$\mathcal {H}=(V,\mathcal {E})$$ be a hypergraph with maximum edge size $$\ell $$ and degree $$\varDelta . For given positive integers $$b_v$$ , $$v\in V$$ set multicover in {H}$$ is of edges $$C \subseteq \mathcal {E}$$ such that every vertex v V belongs to at least C. Set the problem finding minimum-cardinality multicover. Peleg, Schechtman Wool conjectured for any fixed $$b:=\min _{v\in...

In this paper, we propose an algorithm for numerical solving an inverse non-linear diusion problem. In additional, the least-squares method is adopted tond the solution. To regularize the resultant ill-conditioned linear system ofequations, we apply the Tikhonov regularization method to obtain the stablenumerical approximation to the solution. Some numerical experiments con-rm the utility of th...