Minimum cost spanning tree (mcst) problems study situations in which agents must connect to a source obtain good, with the of building an edge being independent number users. We reinterpret mcst as value sharing problems, and show that folk cycle-complete solutions, two most studied cost-sharing solutions for do not share values consistent way. More precisely, yielding same problem might lead s...

In this article, we propose an adaptive grid based on mesh equidistribution principle for two-parameter convection-diffusion boundary value problems with continuous and discontinuous data. A numerical algorithm based on an upwind finite difference operator and an appropriate adaptive grid is constructed. Truncation errors are derived for both continuous and discontinuous problems. Parameter uni...

Evaluating the expectation of a quantum circuit is classically difficult problem known as mean value (QMV). It used to optimize approximate optimization algorithm and other variational eigensolvers. We show that such an can be improved substantially by using approximation rather than exact expectation. Together with efficient classical sampling algorithms, minimal gate count thus improve effici...

in this paper, we present a new two-step trigonometrically fitted symmetric obrechkoff method. the method is based on the symmetric two-step obrechkoff method, with eighth algebraic order, high phase-lag order and is constructed to solve ivps with periodic solutions such as orbital problems. we compare the new method to some recently constructed optimized methods from the literature. the numeri...