cost functions Upgrading min–max spanning tree problem under various Theoretical Computer Science

To discuss the relative stability and the most pre- ferred position, we have calculated the total ground state energy of our 936 particle system before doping, immediately after we

Computational results based on randomly generated graphs show that the number of k -branch vertices included in the spanning tree increases with the size of the vertex set V,

• V (p) is the maximal expected utility that the insurer can get when she invests the related fund on the market and she sells a variable annuities contract at the price p..

Abstract—In this paper, we propose a successive convex approximation framework for sparse optimization where the nonsmooth regularization function in the objective function is

In Section 6, we prove that the MEC problem is NP-complete even for complete graphs with bi-valued edge weights, and we give an asymptotic 4 3 -approximation algorithm for

We study the following generalization of the classical edge coloring problem: Given a weighted graph, find a partition of its edges into matchings (colors), each one of weight equal

Revisit Proposition 5 and remark that if m < (log 1.5874/ log 3)opt(G) ≈ 0.42opt(G), then the parameterized algorithm of Proposition 5 runs faster than that of Proposition 4

Moreover, when used for xed classes G of graphs having optimum (APSPs) compact routing schemes, the construction of an MDST of G ∈ G may be performed by using interval, linear