Approximation algorithms for min-sum \(p\)-clustering
type: Item
instance of: scholarly article
title: Approximation algorithms for min-sum \(p\)-clustering
zbMATH Open document ID: 0921.68044
DOI: 10.1016/S0166-218X(98)00100-0
author: Nili Guttmann-Beck
author: Refael Hassin
published in: Discrete Applied Mathematics
publication date: 1999-03-22T00:00:00Z
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 1267546
zbMATH Keywords: \(p\)-clustering
zbMATH Keywords: approximation algorithm
MaRDI profile type: Publication
cites work: Approximate Max-Flow Min-(Multi)Cut Theorems and Their Applications
cites work: Printer graphics for clustering
cites work: On the completeness of a generalized matching problem
cites work: P-Complete Approximation Problems
cites work: Geometric algorithms for the minimum cost assignment problem
description: scientific article; zbMATH DE number 1267546