Additional Information
| Author(s) | Pop, Petrică Claudiu |
|---|
Approximation results for the generalized minimum spanning tree problem
Petrică Claudiu Pop
Abstract
carpathian_2002_18_095_104_abstractFull PDF
carpathian_2002_18_095_104We consider the Generalized Minimum Spanning Tree problem denoted by GMST. It is known that the GMST problem is NP-hard. Throughout this paper we distinguish between so-called positive results and negative in the area of approximation theory. We present an in-approximability result for the GMST problem and under special assumptions we give an approximation algorithm for the problem.
Recently posted
-
Stability of new functional equations and partial multipliers in Banach *-algebras
-
Characterizations of amenable gyrogroups related to Tarski's Theorem
-
Two new extragradient methods for solving pseudomonotone the equilibrium problem in Hilbert spaces
-
On the error estimates for the sequence of successive approximations for cyclic \varphi–contractions in metric spaces
-
Hybrid CG-Like Algorithm for Nonlinear Equations and Image Restoration
-
New class of n-order fractional differential equations and solvability in the double sequence space m^2(\Delta_{v}^{u}, \phi,p)
-
Constructing DNA Codes using Double Cyclic Codes of Odd and Even Lengths over F2 + u F2
-
Consequences of the product rule in Stieltjes differentiability
-
On the existence and uniqueness of fixed points in Banach spaces using the Krasnoselskij iterative method
-
A quaternionic product of simple ratios