Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center
Copyright policy )Polynomial-Time Approximation Algorithm for the Problem of Cardinality-Weighted Variance-Based 2-Clustering with a Given Center
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
- Russian Academy of Sciences Russian Federation
- Sobolev Institute of Mathematics Russian Federation
- Novosibirsk State University Russian Federation
Applications of mathematical programming, Euclidean space, Computer graphics; computational geometry (digital and algorithmic aspects), weighted 2-clustering, NP-hardness, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Approximation algorithms, polynomial-time 2-approximation algorithm
Applications of mathematical programming, Euclidean space, Computer graphics; computational geometry (digital and algorithmic aspects), weighted 2-clustering, NP-hardness, Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.), Approximation algorithms, polynomial-time 2-approximation algorithm
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).7 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Average impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!