An optimal approximation algorithm for the rectilinearm-center problem

Algorithmica ◽  
1990 ◽  
Vol 5 (1-4) ◽  
pp. 341-352 ◽  
Author(s):  
M. T. Ko ◽  
R. C. T. Lee ◽  
J. S. Chang
Keyword(s):  
Approximation Algorithm ◽  
Optimal Approximation ◽  
Center Problem

Optimal approximation algorithm of feature coefficients and identification of target

1994 ◽  
Vol 11 (1) ◽  
pp. 57-63
Author(s):  
Liao Supeng ◽  
Li Xingguo ◽  
Fang Dagang
Keyword(s):  
Approximation Algorithm ◽  
Optimal Approximation

When a worse approximation factor gives better performance: a 3-approximation algorithm for the vertex k-center problem

2017 ◽  
Vol 23 (5) ◽  
pp. 349-366 ◽  
Author(s):  
Jesus Garcia-Diaz ◽  
Jairo Sanchez-Hernandez ◽  
Ricardo Menchaca-Mendez ◽  
Rolando Menchaca-Mendez
Keyword(s):  
Approximation Algorithm ◽  
Center Problem ◽  
Approximation Factor

Constrained k-Center Problem on a Convex Polygon

2020 ◽  
Vol 31 (02) ◽  
pp. 275-291 ◽  
Author(s):  
Manjanna Basappa ◽  
Ramesh K. Jallu ◽  
Gautam K. Das
Keyword(s):  
Approximation Algorithm ◽  
Convex Polygon ◽  
Covering Problem ◽  
Center Problem ◽  
Entire Region ◽  
Approximation Factor ◽  
Minimum Radius

In this paper, we consider a restricted covering problem, in which a convex polygon [Formula: see text] with [Formula: see text] vertices and an integer [Formula: see text] are given, the objective is to cover the entire region of [Formula: see text] using [Formula: see text] congruent disks of minimum radius [Formula: see text], centered on the boundary of [Formula: see text]. For [Formula: see text] and any [Formula: see text], we propose an [Formula: see text]-factor approximation algorithm for this problem, which runs in [Formula: see text] time. The best known approximation factor of the algorithm for the problem in the literature is 1.8841 [H. Du and Y. Xu: An approximation algorithm for [Formula: see text]-center problem on a convex polygon, J. Comb. Optim. 27(3) (2014) 504–518].

AnO(log*n) Approximation Algorithm for the Asymmetricp-Center Problem

1998 ◽  
Vol 27 (2) ◽  
pp. 259-268 ◽  
Author(s):  
Rina Panigrahy ◽  
Sundar Vishwanathan
Keyword(s):  
Approximation Algorithm ◽  
Center Problem

scholarly journals Approximation algorithm for the kinetic robust K-center problem

2010 ◽  
Vol 43 (6-7) ◽  
pp. 572-586 ◽  
Author(s):  
Sorelle A. Friedler ◽  
David M. Mount
Keyword(s):  
Approximation Algorithm ◽  
Center Problem

The minimum zone evaluation for elliptical profile error based on the geometry optimal approximation algorithm

Measurement ◽  
2015 ◽  
Vol 75 ◽  
pp. 284-288 ◽  
Author(s):  
Lei Xianqing ◽  
Gao Zuobin ◽  
Cui Jingwei ◽  
Wang Haiyang ◽  
Wang Shifeng
Keyword(s):  
Approximation Algorithm ◽  
Optimal Approximation ◽  
Profile Error ◽  
Minimum Zone

A simple greedy approximation algorithm for the minimum connected $$k$$ k -Center problem

2015 ◽  
Vol 31 (4) ◽  
pp. 1417-1429 ◽  
Author(s):  
Dongyue Liang ◽  
Liquan Mei ◽  
James Willson ◽  
Wei Wang
Keyword(s):  
Approximation Algorithm ◽  
Center Problem ◽  
Greedy Approximation

An approximation algorithm for the edge-dilation k-center problem

2004 ◽  
Vol 32 (5) ◽  
pp. 491-495 ◽  
Author(s):  
Jochen Könemann ◽  
Yanjun Li ◽  
Ojas Parekh ◽  
Amitabh Sinha
Keyword(s):  
Approximation Algorithm ◽  
Center Problem
Sign in / Sign up

Export Citation Format

Share Document