scholarly journals A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem

2021 ◽  
pp. 340-353
Author(s):  
Manuel Aprile ◽  
Matthew Drescher ◽  
Samuel Fiorini ◽  
Tony Huynh
Keyword(s):  
Approximation Algorithm ◽  
Vertex Deletion

scholarly journals A Simple $$(2+\epsilon )$$-Approximation Algorithm for Split Vertex Deletion

2021 ◽  
pp. 307-310
Author(s):  
Matthew Drescher ◽  
Samuel Fiorini ◽  
Tony Huynh
Keyword(s):  
Approximation Algorithm ◽  
Vertex Deletion ◽  
Split Vertex

scholarly journals A tight approximation algorithm for the cluster vertex deletion problem

2022 ◽  
Author(s):  
Manuel Aprile ◽  
Matthew Drescher ◽  
Samuel Fiorini ◽  
Tony Huynh
Keyword(s):  
Approximation Algorithm ◽  
Vertex Deletion

Vertex deletion and cycles in multipartite tournaments

1999 ◽  
Vol 197-198 (1-3) ◽  
pp. 769-779 ◽  
Author(s):  
M Tewes
Keyword(s):  
Multipartite Tournaments ◽  
Vertex Deletion

An Improved Sequential Polygonal Approximation Algorithm on Skeleton Curves

2009 ◽  
Vol 34 (12) ◽  
pp. 1467-1474
Author(s):  
Zhe LV ◽  
Fu-Li WANG ◽  
Yu-Qing CHANG ◽  
Yang LIU
Keyword(s):  
Approximation Algorithm ◽  
Polygonal Approximation

The minimum zone fitting and error evaluation for the logarithmic curve based on geometry optimization approximation algorithm

2019 ◽  
Vol 41 (15) ◽  
pp. 4380-4386
Author(s):  
Tu Xianping ◽  
Lei Xianqing ◽  
Ma Wensuo ◽  
Wang Xiaoyi ◽  
Hu Luqing ◽  
...  
Keyword(s):  
Approximation Algorithm ◽  
Evaluation Method ◽  
Geometry Optimization ◽  
Reference Points ◽  
Approximation Technique ◽  
Error Evaluation ◽  
Iterative Approximation ◽  
Logarithmic Curve ◽  
Normal Distance ◽  
Minimum Zone

The minimum zone fitting and error evaluation for the logarithmic curve has important applications. Based on geometry optimization approximation algorithm whilst considering geometric characteristics of logarithmic curves, a new fitting and error evaluation method for the logarithmic curve is presented. To this end, two feature points, to serve as reference, are chosen either from those located on the least squares logarithmic curve or from amongst measurement points. Four auxiliary points surrounding each of the two reference points are then arranged to resemble vertices of a square. Subsequently, based on these auxiliary points, a series of auxiliary logarithmic curves (16 curves) are constructed, and the normal distance and corresponding range of values between each measurement point and all auxiliary logarithmic curves are calculated. Finally, by means of an iterative approximation technique consisting of comparing, evaluating, and changing reference points; determining new auxiliary points; and constructing corresponding auxiliary logarithmic curves, minimum zone fitting and evaluation of logarithmic curve profile errors are implemented. The example results show that the logarithmic curve can be fitted, and its profile error can be evaluated effectively and precisely using the presented method.

scholarly journals Approximation algorithm for minimum connected 3-path vertex cover

2020 ◽  
Vol 287 ◽  
pp. 77-84
Author(s):  
Pengcheng Liu ◽  
Zhao Zhang ◽  
Xianyue Li ◽  
Weili Wu
Keyword(s):  
Approximation Algorithm ◽  
Vertex Cover

scholarly journals A Polynomial Kernel for Distance-Hereditary Vertex Deletion

Algorithmica ◽  
2021 ◽  
Author(s):  
Eun Jung Kim ◽  
O-joung Kwon
Keyword(s):  
Polynomial Kernel ◽  
Vertex Deletion

An approximation algorithm for the k-generalized Steiner forest problem

2021 ◽  
Author(s):  
Jiawen Gao ◽  
Suogang Gao ◽  
Wen Liu ◽  
Weili Wu ◽  
Ding-Zhu Du ◽  
...  
Keyword(s):  
Approximation Algorithm ◽  
Steiner Forest
Sign in / Sign up

Export Citation Format

Share Document