k-切问题的多项式算法

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science Pub Date : 1988-10-24 DOI:10.1109/SFCS.1988.21960

O. Goldschmidt, D. Hochbaum

{"title":"k-切问题的多项式算法","authors":"O. Goldschmidt, D. Hochbaum","doi":"10.1109/SFCS.1988.21960","DOIUrl":null,"url":null,"abstract":"The k-cut problem is to find a partition of an edge weighted graph into k nonempty components, such that the total edge weight between components is minimum. This problem is NP-complete for arbitrary k and its version involving fixing a vertex in each component is NP hard even for k=3. A polynomial algorithm for the case of a fixed k is presented.<<ETX>>","PeriodicalId":113255,"journal":{"name":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1988-10-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"202","resultStr":"{\"title\":\"Polynomial algorithm for the k-cut problem\",\"authors\":\"O. Goldschmidt, D. Hochbaum\",\"doi\":\"10.1109/SFCS.1988.21960\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The k-cut problem is to find a partition of an edge weighted graph into k nonempty components, such that the total edge weight between components is minimum. This problem is NP-complete for arbitrary k and its version involving fixing a vertex in each component is NP hard even for k=3. A polynomial algorithm for the case of a fixed k is presented.<<ETX>>\",\"PeriodicalId\":113255,\"journal\":{\"name\":\"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1988-10-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"202\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SFCS.1988.21960\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SFCS.1988.21960","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 202

摘要

k切问题是将一个边加权图划分为k个非空分量，使各分量之间的总边权最小。这个问题对于任意k来说是NP完全的，它的版本包括在每个组件中固定一个顶点，即使对于k=3也是NP困难的。对于k固定的情况，给出了一种多项式算法。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Polynomial algorithm for the k-cut problem

The k-cut problem is to find a partition of an edge weighted graph into k nonempty components, such that the total edge weight between components is minimum. This problem is NP-complete for arbitrary k and its version involving fixing a vertex in each component is NP hard even for k=3. A polynomial algorithm for the case of a fixed k is presented.<>

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

[Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science

自引率

0.00%

发文量