Approximation Schemes for Capacitated Clustering in Doubling Metrics

doi 10.1137/1.9781611975994.138
Full Text
Abstract

Available in full text

Date
Authors
Publisher

Society for Industrial and Applied Mathematics

Related search

Approximation of Partial Capacitated Vertex Cover

SIAM Journal on Discrete Mathematics
Mathematics
2010English

Small Hop-Diameter Sparse Spanners for Doubling Metrics

2006English

A Tabu Search Algorithm for a Capacitated Clustering Problem

International Journal of Operational Research
Management ScienceOperations Research
2018English

A QPTAS for TSP With Fat Weakly Disjoint Neighborhoods in Doubling Metrics

Discrete and Computational Geometry
CombinatoricsMathematicsGeometryDiscrete MathematicsComputational TheoryTopologyTheoretical Computer Science
2011English

Reducing Curse of Dimensionality: Improved PTAS for TSP (With Neighborhoods) in Doubling Metrics

2015English

Inapproximability of Clustering in Lp Metrics

2019English

New Approximation Schemes for General Variational Inequalities

Journal of Mathematical Analysis and Applications
Applied MathematicsAnalysis
2000English

Best Clustering Configuration Metrics: Towards Multiagent Based Clustering

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2010English

Approximation Schemes for Preemptive Weighted Flow Time

2002English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy