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
-
An inertial method for solving the split equality fixed point problem with multiple output sets
-
Asymptotic modeling of non-linear viscopiezoelectric Kelvin-Voigt type plates via Trotter theory
-
Properties of isocompact spaces in topological groups
-
Two generalized cyclic projection algorithms for solving a class of the split feasibility problem in real Hilbert spaces
-
Global-fixed-point property of gyrogroup actions
-
On simple normal structure and best proximity points in reflexive Banach space
-
Unified Convergence Analysis of Certain At Least Fifth Order Methods
-
A set packing model for the Partition Coloring Problem
-
Cut-through connections of graphs
-
Positive solutions for multipoint boundary value problem of fractional differential equation with parameter