Year: 2013
Type: article
Abstract: Significant research effort has been devoted in the study of approximation algorithms for NP-hard problems.In this work we modify a known primal-dual approximation algorithm for facility location problem.Although we fail to give a performance guarantee for the new approach but we show that our method performs better in a tight case.
DOI: 10.5120/11436-6621
Authors: Pawan KumarPatel, Vivek Sharma
Institution: Indian Institute of Technology Kanpur
Language: English
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze
OpenAlex ID: W2128671402