Inapproximability of Clustering in Lp Metrics

doi 10.1109/focs.2019.00040
Full Text
Abstract

Available in full text

Date
Authors
Publisher

IEEE

Related search

Best Clustering Configuration Metrics: Towards Multiagent Based Clustering

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Word Clustering Based on Un-Lp Algorithm

2014English

Approximation Schemes for Capacitated Clustering in Doubling Metrics

2020English

Improved Inapproximability of Rainbow Coloring

2020English

A Probe on Document Clustering Methodologies and Its Performance Metrics

International Journal of Recent Technology and Engineering
EngineeringManagement of TechnologyInnovation
2019English

A Study on Performance Metrics and Clustering Methods for Analyzing Behavior in UAV Operations

Journal of Intelligent and Fuzzy Systems
EngineeringStatisticsProbabilityArtificial Intelligence
2017English

Inapproximability of the Minimum Biclique Edge Partition Problem

IEICE Transactions on Information and Systems
Electronic EngineeringPattern RecognitionHardwareComputer VisionElectricalArchitectureArtificial IntelligenceSoftware
2010English

Inapproximability of Hypergraph Vertex Cover and Applications to Scheduling Problems

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes

Mathematics of Operations Research
Management ScienceComputer Science ApplicationsOperations ResearchMathematics
2006English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy