Minimum cost subpartitions in graphs
type: Item
instance of: scholarly article
title: Minimum cost subpartitions in graphs
zbMATH Open document ID: 1185.05139
author: Hiroshi Nagamochi
author: Yoko Kamidoi
published in: Information Processing Letters
publication date: 2010-01-29T00:00:00Z
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C40
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 5664783
zbMATH Keywords: approximation algorithms
zbMATH Keywords: extreme vertex sets
zbMATH Keywords: clustering
zbMATH Keywords: cut
zbMATH Keywords: graph
zbMATH Keywords: \(k\)-way cut
zbMATH Keywords: partition
MaRDI profile type: Publication
full work available at URL: j.ipl.2006.11.011
OpenAlex ID: W2090987888
cites work: Optimal attack and reinforcement of a network
cites work: A Polynomial Algorithm for the k-cut Problem for Fixed k
cites work: Connectivity and edge-disjoint spanning trees
cites work: A Deterministic Algorithm for Finding All Minimum k‐Way Cuts
cites work: On minimum 3-cuts and approximating k-cuts using Cut Trees
cites work: A new approach to the minimum cut problem
cites work: GRAPH ALGORITHMS FOR NETWORK CONNECTIVITY PROBLEMS(<Special Issue>Network Design, Control and Optimization)
cites work: Tree packing and approximating \(k\)-cuts
cites work: Q4828991
cites work: Finding k Cuts within Twice the Optimal
cites work: Edge-connectivity augmentation problems
cites work: Approximation the minimum \(k\)-way cut in a graph via minimum 3-way cuts
DOI: 10.1016/J.IPL.2006.11.011
description: scientific article; zbMATH DE number 5664783