A Local Search Approximation Algorithm for the k-means Problem with Penalties

2017 ◽  
pp. 568-574 ◽  
Author(s):  
Dongmei Zhang ◽  
Chunlin Hao ◽  
Chenchen Wu ◽  
Dachuan Xu ◽  
Zhenning Zhang
Keyword(s):  
Approximation Algorithm ◽  
Local Search

A local search approximation algorithm for a squared metric k-facility location problem

2018 ◽  
Vol 35 (4) ◽  
pp. 1168-1184
Author(s):  
Dongmei Zhang ◽  
Dachuan Xu ◽  
Yishui Wang ◽  
Peng Zhang ◽  
Zhenning Zhang
Keyword(s):  
Approximation Algorithm ◽  
Local Search ◽  
Facility Location ◽  
Location Problem ◽  
Facility Location Problem

scholarly journals A local search approximation algorithm for k-means clustering

2004 ◽  
Vol 28 (2-3) ◽  
pp. 89-112 ◽  
Author(s):  
Tapas Kanungo ◽  
David M. Mount ◽  
Nathan S. Netanyahu ◽  
Christine D. Piatko ◽  
Ruth Silverman ◽  
...  
Keyword(s):  
Approximation Algorithm ◽  
Local Search

scholarly journals A Novel Local Search-Based Approximation Algorithm to Optimize Virtual Machine Placement With Resource Constraints

2021 ◽  
Vol 335 ◽  
pp. 04007
Author(s):  
Darshan Maheshbhai Shah ◽  
M. Vinayaka Murthi ◽  
Anand Kumar
Keyword(s):  
Approximation Algorithm ◽  
Local Search ◽  
Virtual Machine ◽  
Resource Constraints ◽  
Virtual Machine Placement ◽  
Np Hard ◽  
Cloud Data Center ◽  
Cloud Data ◽  
Multiple Resources ◽  
Benchmark Instances

Many problems in cloud computing are not solvable in polynomial time and only option left is to choose approximate solution instead of optimum. Virtual Machine placement is one of such problem with resource constraints in which overall objective is to optimize multiple resources of hosts during placement process. In this paper we have addressed this problem with large size NP-Hard instances and proposed novel local search-based approximation algorithm. This problem is not yet studied in the research community with NP hard instances. A new proposed algorithm is empirically evaluated with state-of-the-art techniques. and our algorithm has improved placement result by 18% in CPU utilization, 21% in resource contention and 26% in overall resource utilization for benchmark instances collected from azure private cloud data center.

scholarly journals Improved Local Search Based Approximation Algorithm for Hard Uniform Capacitated k-Median Problem

Informatica ◽  
2018 ◽  
Vol 42 (3) ◽  
Author(s):  
Sapna Grover ◽  
Neelima Gupta ◽  
Aditya Pancholi
Keyword(s):  
Approximation Algorithm ◽  
Local Search ◽  
Median Problem
Sign in / Sign up

Export Citation Format

Share Document