Local Search Approximation Algorithms for the Spherical k-Means Problem

2019 ◽  
pp. 341-351 ◽  
Author(s):  
Dongmei Zhang ◽  
Yukun Cheng ◽  
Min Li ◽  
Yishui Wang ◽  
Dachuan Xu
Keyword(s):  
Approximation Algorithms ◽  
Local Search

Approximation algorithms for spherical k-means problem using local search scheme

2021 ◽  
Vol 853 ◽  
pp. 65-77 ◽  
Author(s):  
Dongmei Zhang ◽  
Yukun Cheng ◽  
Min Li ◽  
Yishui Wang ◽  
Dachuan Xu
Keyword(s):  
Approximation Algorithms ◽  
Local Search

Local search approximation algorithms for the sum of squares facility location problems

2019 ◽  
Vol 74 (4) ◽  
pp. 909-932
Author(s):  
Dongmei Zhang ◽  
Dachuan Xu ◽  
Yishui Wang ◽  
Peng Zhang ◽  
Zhenning Zhang
Keyword(s):  
Approximation Algorithms ◽  
Local Search ◽  
Facility Location ◽  
Sum Of Squares ◽  
Location Problems ◽  
Facility Location Problems

Local search approximation algorithms for the k-means problem with penalties

2018 ◽  
Vol 37 (2) ◽  
pp. 439-453 ◽  
Author(s):  
Dongmei Zhang ◽  
Chunlin Hao ◽  
Chenchen Wu ◽  
Dachuan Xu ◽  
Zhenning Zhang
Keyword(s):  
Approximation Algorithms ◽  
Local Search

scholarly journals Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree

2017 ◽  
Vol 252 ◽  
pp. 187-200 ◽  
Author(s):  
Wenjun Li ◽  
Yixin Cao ◽  
Jianer Chen ◽  
Jianxin Wang
Keyword(s):  
Approximation Algorithms ◽  
Local Search ◽  
Spanning Tree

scholarly journals On the Steiner Tree 3/2-Approximation for Quasi-Bipartite Graphs

1999 ◽  
Vol 6 (39) ◽  
Author(s):  
Romeo Rizzi
Keyword(s):  
Approximation Algorithms ◽  
Approximation Algorithm ◽  
Local Search ◽  
Key Words ◽  
Steiner Tree ◽  
Minimum Weight ◽  
Bipartite Graphs ◽  
Simple Graph ◽  
Steiner Tree Problem ◽  
Stable Set

<p>Let G = (V,E) be an undirected simple graph and w : E -> R+ be<br />a non-negative weighting of the edges of G. Assume V is partitioned<br />as R union X. A Steiner tree is any tree T of G such that every node<br />in R is incident with at least one edge of T. The metric Steiner tree<br />problem asks for a Steiner tree of minimum weight, given that w is a<br />metric. When X is a stable set of G, then (G,R,X) is called quasi-bipartite.<br /> In [1], Rajagopalan and Vazirani introduced the notion of<br />quasi-bipartiteness and gave a ( 3/2 + epsilon) approximation algorithm<br /> for the metric Steiner tree problem, when (G,R,X) is quasi-bipartite. In this<br />paper, we simplify and strengthen the result of Rajagopalan and Vazirani.<br />We also show how classical bit scaling techniques can be adapted<br />to the design of approximation algorithms.</p><p>Key words: Steiner tree, local search, approximation algorithm, bit scaling.</p><p> </p>

Sign in / Sign up

Export Citation Format

Share Document