Approximation algorithms for the metric maximum clustering problem with given cluster sizes

被引：2
|
作者：
Hassin, R [1 ]
Rubinstein, S [1 ]
机构：
[1] Tel Aviv Univ, Sch Math Sci, Dept Stat & Operat Res, IL-69978 Tel Aviv, Israel
来源：
OPERATIONS RESEARCH LETTERS | 2003年 / 31卷 / 03期
关键词：
approximation algorithms; maximum clustering;
D O I：
10.1016/S0167-6377(02)00235-3
中图分类号：
C93 [管理学]; O22 [运筹学];
学科分类号：
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要：
The input to the METRIC MAXIMUM CLUSTERING PROBLEM WITH GIVEN CLUSTER SIZES consists of a complete graph G=(V, E) with edge weights satisfying the triangle inequality, and integers c(1),...., c(p) that sum to I V. The goal is to find a partition of V into disjoint clusters of sizes c(1),....,c(p), that maximizes the sum of weights of edges whose two ends belong to the same cluster. We describe approximation algorithms for this problem. (C) 2003 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：179 / 184
页数：6
相关论文
共 50 条
  • [31] Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
    Xiaofei Liu
    Yajie Li
    Weidong Li
    Jinhua Yang
    Journal of Combinatorial Optimization, 2023, 45
  • [32] Combinatorial approximation algorithms for the maximum bounded connected bipartition problem
    Liu, Xiaofei
    Li, Yajie
    Li, Weidong
    Yang, Jinhua
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2023, 45 (01)
  • [33] Two New Approximation Algorithms for the Maximum Planar Subgraph Problem
    Poranen, Timo
    ACTA CYBERNETICA, 2008, 18 (03): : 503 - 527
  • [34] ON THE RELATIONSHIP OF APPROXIMATION ALGORITHMS FOR THE MINIMUM AND THE MAXIMUM TRAVELING SALESMAN PROBLEM
    KORNER, F
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1986, 26 (02) : 262 - 265
  • [35] An experimental evaluation of fast approximation algorithms for the maximum satisfiability problem
    Poloczek M.
    Williamson D.P.
    ACM Journal of Experimental Algorithmics, 2017, 22
  • [36] Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem
    Zhi-Zhong Chen
    Guohui Lin
    Lusheng Wang
    Yong Chen
    Dan Wang
    Algorithmica, 2019, 81 : 4167 - 4199
  • [37] Two new approximation algorithms for the maximum planar subgraph problem
    Department of Computer Sciences, University of Tampere, P.O. Box 607, FIN-33014, Tampere, Finland
    Acta Cybern, 2008, 3 (503-527):
  • [38] Approximation algorithms for some extensions of the maximum profit routing problem
    Bogdan Armaselu
    Journal of Combinatorial Optimization, 2023, 45
  • [39] Approximation Algorithms for the Maximum Weight Internal Spanning Tree Problem
    Chen, Zhi-Zhong
    Lin, Guohui
    Wang, Lusheng
    Chen, Yong
    Wang, Dan
    ALGORITHMICA, 2019, 81 (11-12) : 4167 - 4199
  • [40] Approximation algorithms for the maximum power consumption problem on combinatorial circuits
    Asano, T
    Halldórsson, MM
    Iwama, K
    Matsuda, T
    ALGORITHM AND COMPUTATION, PROCEEDINGS, 2001, 1969 : 204 - 215
12345