Approximation algorithms for balancing signed graphs
type: Item
instance of: scholarly article
title: Approximation algorithms for balancing signed graphs
zbMATH Open document ID: 1482.68172
DOI: 10.1007/978-3-030-57602-8_36
author: Zhuo Diao
author: Zhongzheng Tang
publication date: 2021-07-05T00:00:00Z
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68Q17
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 7367776
zbMATH Keywords: balance
zbMATH Keywords: signed graph
zbMATH Keywords: NP-hardness
zbMATH Keywords: approximation algorithms
MaRDI profile type: Publication
full work available at URL: 978-3-030-57602-8 36
OpenAlex ID: W3047927251
cites work: Social balance on networks: the dynamics of friendship and enmity
cites work: Q4931752
cites work: On the notion of balance of a signed graph
cites work: Some optimal inapproximability results
cites work: Optimal Inapproximability Results for MAX‐CUT and Other 2‐Variable CSPs?
cites work: Gadgets, Approximation, and Linear Programming
cites work: A mathematical bibliography of signed and gain graphs and allied areas
description: scientific article; zbMATH DE number 7367776