A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem
type: Item
instance of: scholarly article
title: A new approximation algorithm for the unbalanced min \(s\)-\(t\) cut problem
zbMATH Open document ID: 1333.05250
author: Peng Zhang
published in: Theoretical Computer Science
publication date: 2015-12-11T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C05
zbMATH DE Number: 6520550
zbMATH Keywords: unbalanced cut
zbMATH Keywords: Min \(s\)-\(t\) Cut
zbMATH Keywords: approximation algorithm
zbMATH Keywords: linear programming
zbMATH Keywords: network community
MaRDI profile type: Publication
full work available at URL: j.tcs.2015.02.040
OpenAlex ID: W1976598820
cites work: A New Approximation Algorithm for the Unbalanced Min s-t Cut Problem
cites work: Unbalanced Graph Partitioning
cites work: On cutting a few vertices from a graph
cites work: On the Parameterized Complexity of Cutting a Few Vertices from a Graph
cites work: Algorithms – ESA 2005
cites work: Q3549709
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: A new approach to the minimum cut problem
cites work: Q5743436
cites work: Multicriteria global minimum cuts
cites work: Computing All Small Cuts in an Undirected Network
cites work: Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
cites work: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
cites work: Critical Load Factors in Two-Processor Distributed Systems
cites work: A new approach to the maximum-flow problem
cites work: Q4217266
DOI: 10.1016/J.TCS.2015.02.040
description: scientific article; zbMATH DE number 6520550