Approximation algorithms for NP-hard clustering problems

Not available === text

Bibliographic Details
Main Author: Mettu, Ramgopal Reddy
Format: Others
Language:English
Published: 2008
Subjects:
Online Access:http://hdl.handle.net/2152/782
id ndltd-UTEXAS-oai-repositories.lib.utexas.edu-2152-782
record_format oai_dc
spelling ndltd-UTEXAS-oai-repositories.lib.utexas.edu-2152-7822015-09-20T16:49:13ZApproximation algorithms for NP-hard clustering problemsMettu, Ramgopal ReddyProgramming (Mathematics)Approximation theoryAlgorithmsNot availabletext2008-08-28T21:34:44Z2008-08-28T21:34:44Z20022008-08-28T21:34:44ZThesiselectronicb57165609http://hdl.handle.net/2152/782568182003099495engCopyright is held by the author. Presentation of this material on the Libraries' web site by University Libraries, The University of Texas at Austin was made possible under a limited license grant from the author who has retained all copyrights in the works.
collection NDLTD
language English
format Others
sources NDLTD
topic Programming (Mathematics)
Approximation theory
Algorithms
spellingShingle Programming (Mathematics)
Approximation theory
Algorithms
Mettu, Ramgopal Reddy
Approximation algorithms for NP-hard clustering problems
description Not available === text
author Mettu, Ramgopal Reddy
author_facet Mettu, Ramgopal Reddy
author_sort Mettu, Ramgopal Reddy
title Approximation algorithms for NP-hard clustering problems
title_short Approximation algorithms for NP-hard clustering problems
title_full Approximation algorithms for NP-hard clustering problems
title_fullStr Approximation algorithms for NP-hard clustering problems
title_full_unstemmed Approximation algorithms for NP-hard clustering problems
title_sort approximation algorithms for np-hard clustering problems
publishDate 2008
url http://hdl.handle.net/2152/782
work_keys_str_mv AT metturamgopalreddy approximationalgorithmsfornphardclusteringproblems
_version_ 1716819732492976128