Graph classes and approximability of the happy set problem
type: Item
instance of: scholarly article
title: Graph classes and approximability of the happy set problem
DOI: 10.1007/978-3-030-58150-3_27
author: Yuichi Asahiro
author: Hiroshi Eto
author: Tesshu Hanaka
author: Eiji Miyano
author: Ippei Terabaru
author: Guohui Lin
publication date: 2021-04-21T00:00:00Z
Mathematics Subject Classification ID: 68Rxx
zbMATH DE Number: 7336116
MaRDI profile type: Publication
full work available at URL: 978-3-030-58150-3 27
OpenAlex ID: W3081852812
cites work: On the parameterized complexity of happy vertex coloring
cites work: Linear Time Algorithms for Happy Vertex Coloring Problems for Trees
cites work: Parameterized algorithms for the happy set problem
cites work: Complexity of finding dense subgraphs
cites work: Detecting high log-densities, an \(O(n^{1/4})\) approximation for densest \(k\)-subgraph
cites work: Exact and superpolynomial approximation algorithms for the \textsc{densest \textit{K}-subgraph} problem
cites work: Exact and Approximation Algorithms for Densest k-Subgraph
cites work: Tight complexity bounds for FPT subgraph problems parameterized by the clique-width
cites work: Exact algorithms for problems related to the densest \(k\)-set problem
cites work: On structural parameterizations of happy coloring, empire coloring and boxicity
cites work: Clustering and domination in perfect graphs
cites work: Q4931752
cites work: The dense \(k\)-subgraph problem
cites work: Q4198056
cites work: Ruling Out PTAS for Graph Min‐Bisection, Dense k‐Subgraph, and Bipartite Clique
cites work: Finding happiness: an analysis of the maximum happy vertices problem
cites work: Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
cites work: PTAS for densest \(k\)-subgraph in interval graphs
cites work: Depth-First Search and Linear Graph Algorithms
cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
cites work: Improved Approximation Algorithms for the Maximum Happy Vertices and Edges Problems
cites work: Algorithmic aspects of homophyly of networks
cites work: Improved approximation algorithms for the maximum happy vertices and edges problems
description: scientific article; zbMATH DE number 7336116