Improved approximation algorithms for the maximum happy vertices and edges problems
type: Item
instance of: scholarly article
title: Improved approximation algorithms for the maximum happy vertices and edges problems
zbMATH Open document ID: 1387.68301
author: Peng Zhang
author: Yao Xu
author: Tao Jiang
author: Eiji Miyano
author: Angsheng Li
author: Guohui Lin
published in: Algorithmica
publication date: 2018-05-18T00:00:00Z
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6870375
zbMATH Keywords: maximum happy vertices
zbMATH Keywords: maximum happy edges
zbMATH Keywords: approximation algorithm
zbMATH Keywords: randomized rounding
zbMATH Keywords: network homophyly
MaRDI profile type: Publication
full work available at URL: s00453-017-0302-8
OpenAlex ID: W1164874588
cites work: Linear Programming in O([n3/ln n]L) Operations
cites work: Q3327527
cites work: Simplex partitioning via exponential clocks and the multiway cut problem
cites work: An improved approximation algorithm of MULTIWAY CUT.
cites work: The Complexity of Multiterminal Cuts
cites work: Q4931752
cites work: Rounding algorithms for a geometric embedding of minimum multiway cut
cites work: Approximation algorithms for classification problems with pairwise relationships
cites work: Approximation Algorithms for Graph Homomorphism Problems
cites work: Multiway cut, pairwise realizable distributions, and descending thresholds
cites work: Q4258215
cites work: The Design of Approximation Algorithms
cites work: Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
cites work: Algorithmic aspects of homophyly of networks
DOI: 10.1007/S00453-017-0302-8
description: scientific article; zbMATH DE number 6870375