Approximation algorithms for NP-hard clustering problems
Not available === text
Main Author: | Mettu, Ramgopal Reddy |
---|---|
Format: | Others |
Language: | English |
Published: |
2008
|
Subjects: | |
Online Access: | http://hdl.handle.net/2152/782 |
Similar Items
-
An overview on polynomial approximation of NP-hard problems
by: Paschos Vangelis Th.
Published: (2009-01-01) -
Survey of Approximation Algorithms for Set Cover Problem
by: Dutta, Himanshu Shekhar
Published: (2009) -
Approximation algorithms for Lp-ball and quadratically constrained polynomial optimization problems.
Published: (2013) -
A Survey on Approximation in Parameterized Complexity: Hardness and Algorithms
by: Andreas Emil Feldmann, et al.
Published: (2020-06-01) -
Clustering Improves the Goemans–Williamson Approximation for the Max-Cut Problem
by: Angel E. Rodriguez-Fernandez, et al.
Published: (2020-08-01)